/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:39:09,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:39:09,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:39:09,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:39:09,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:39:09,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:39:09,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:39:09,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:39:09,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:39:09,417 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:39:09,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:39:09,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:39:09,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:39:09,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:39:09,419 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:39:09,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:39:09,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:39:09,420 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:39:09,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:39:09,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:39:09,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:39:09,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:39:09,422 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:39:09,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:39:09,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:39:09,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:39:09,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:39:09,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:39:09,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:39:09,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:39:09,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:39:09,673 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:39:09,676 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:39:09,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2023-12-15 20:39:10,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:39:10,874 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:39:10,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2023-12-15 20:39:10,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f88ca718/a298b12c66a14aa0a0bf00fc890aeae7/FLAG8fecc8690 [2023-12-15 20:39:10,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f88ca718/a298b12c66a14aa0a0bf00fc890aeae7 [2023-12-15 20:39:10,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:39:10,897 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:39:10,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:39:10,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:39:10,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:39:10,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:39:10" (1/1) ... [2023-12-15 20:39:10,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2453156b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:10, skipping insertion in model container [2023-12-15 20:39:10,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:39:10" (1/1) ... [2023-12-15 20:39:10,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:39:11,027 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i[917,930] [2023-12-15 20:39:11,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:39:11,078 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:39:11,089 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i[917,930] [2023-12-15 20:39:11,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:39:11,115 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:39:11,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11 WrapperNode [2023-12-15 20:39:11,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:39:11,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:39:11,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:39:11,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:39:11,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,150 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-12-15 20:39:11,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:39:11,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:39:11,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:39:11,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:39:11,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:39:11,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:39:11,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:39:11,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:39:11,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:39:11,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (1/1) ... [2023-12-15 20:39:11,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:39:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:39:11,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:39:11,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:39:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:39:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:39:11,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:39:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:39:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:39:11,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:39:11,376 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:39:11,378 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:39:11,547 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:39:11,582 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:39:11,582 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:39:11,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:39:11 BoogieIcfgContainer [2023-12-15 20:39:11,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:39:11,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:39:11,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:39:11,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:39:11,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:39:10" (1/3) ... [2023-12-15 20:39:11,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71839215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:39:11, skipping insertion in model container [2023-12-15 20:39:11,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:39:11" (2/3) ... [2023-12-15 20:39:11,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71839215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:39:11, skipping insertion in model container [2023-12-15 20:39:11,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:39:11" (3/3) ... [2023-12-15 20:39:11,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-14.i [2023-12-15 20:39:11,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:39:11,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:39:11,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:39:11,635 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@663458bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:39:11,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:39:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:39:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 20:39:11,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:39:11,648 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:39:11,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:39:11,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:39:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 175034516, now seen corresponding path program 1 times [2023-12-15 20:39:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:39:11,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946275295] [2023-12-15 20:39:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:39:11,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:39:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:39:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:39:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:39:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:39:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:39:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:39:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:39:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:39:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:39:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:39:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:39:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:39:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:39:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:39:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:39:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:39:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:39:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:39:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:39:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 20:39:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:39:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-15 20:39:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:39:12,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946275295] [2023-12-15 20:39:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946275295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:39:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:39:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:39:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466634420] [2023-12-15 20:39:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:39:12,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:39:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:39:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:39:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:39:12,059 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-15 20:39:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:39:12,108 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2023-12-15 20:39:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:39:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2023-12-15 20:39:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:39:12,117 INFO L225 Difference]: With dead ends: 101 [2023-12-15 20:39:12,117 INFO L226 Difference]: Without dead ends: 50 [2023-12-15 20:39:12,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:39:12,124 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:39:12,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:39:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-15 20:39:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-15 20:39:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:39:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2023-12-15 20:39:12,168 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 127 [2023-12-15 20:39:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:39:12,168 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2023-12-15 20:39:12,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-15 20:39:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2023-12-15 20:39:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 20:39:12,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:39:12,176 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:39:12,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:39:12,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:39:12,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:39:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1339866646, now seen corresponding path program 1 times [2023-12-15 20:39:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:39:12,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349101907] [2023-12-15 20:39:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:39:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:39:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:39:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:39:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:39:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:39:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:39:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:39:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:39:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:39:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:39:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:39:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:39:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:39:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:39:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:39:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:39:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:39:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:39:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:39:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:39:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 20:39:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:39:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-15 20:39:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:39:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349101907] [2023-12-15 20:39:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349101907] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:39:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:39:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:39:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020859042] [2023-12-15 20:39:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:39:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:39:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:39:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:39:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:39:12,600 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-15 20:39:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:39:12,734 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2023-12-15 20:39:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:39:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2023-12-15 20:39:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:39:12,738 INFO L225 Difference]: With dead ends: 149 [2023-12-15 20:39:12,738 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 20:39:12,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:39:12,741 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:39:12,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 208 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:39:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 20:39:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-12-15 20:39:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-15 20:39:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2023-12-15 20:39:12,779 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 127 [2023-12-15 20:39:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:39:12,781 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 134 transitions. [2023-12-15 20:39:12,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-15 20:39:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2023-12-15 20:39:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 20:39:12,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:39:12,787 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:39:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:39:12,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:39:12,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:39:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 530520020, now seen corresponding path program 1 times [2023-12-15 20:39:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:39:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246485351] [2023-12-15 20:39:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:39:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:39:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:39:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:39:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:39:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:39:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:39:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:39:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:39:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:39:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:39:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:39:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:39:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:39:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:39:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:39:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:39:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:39:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:39:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:39:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 20:39:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 20:39:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 20:39:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-15 20:39:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:39:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246485351] [2023-12-15 20:39:13,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246485351] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:39:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652690220] [2023-12-15 20:39:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:39:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:39:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:39:13,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:39:13,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:39:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:39:13,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 20:39:13,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:39:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-15 20:39:13,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:39:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-15 20:39:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652690220] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:39:13,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:39:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2023-12-15 20:39:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348545257] [2023-12-15 20:39:13,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:39:13,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 20:39:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:39:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 20:39:13,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:39:13,990 INFO L87 Difference]: Start difference. First operand 89 states and 134 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (52), 3 states have call predecessors, (52), 6 states have return successors, (53), 5 states have call predecessors, (53), 5 states have call successors, (53) [2023-12-15 20:39:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:39:14,319 INFO L93 Difference]: Finished difference Result 150 states and 218 transitions. [2023-12-15 20:39:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:39:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (52), 3 states have call predecessors, (52), 6 states have return successors, (53), 5 states have call predecessors, (53), 5 states have call successors, (53) Word has length 127 [2023-12-15 20:39:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:39:14,321 INFO L225 Difference]: With dead ends: 150 [2023-12-15 20:39:14,321 INFO L226 Difference]: Without dead ends: 101 [2023-12-15 20:39:14,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-12-15 20:39:14,322 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 171 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:39:14,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 182 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:39:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-15 20:39:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2023-12-15 20:39:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:39:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-12-15 20:39:14,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 127 [2023-12-15 20:39:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:39:14,332 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-12-15 20:39:14,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 5 states have call successors, (52), 3 states have call predecessors, (52), 6 states have return successors, (53), 5 states have call predecessors, (53), 5 states have call successors, (53) [2023-12-15 20:39:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-12-15 20:39:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 20:39:14,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:39:14,333 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:39:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:39:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:39:14,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:39:14,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:39:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash 530579602, now seen corresponding path program 1 times [2023-12-15 20:39:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:39:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108017335] [2023-12-15 20:39:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:39:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:39:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:39:14,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:39:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:39:14,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:39:14,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:39:14,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:39:14,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:39:14,709 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-15 20:39:14,711 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:39:14,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:39:14 BoogieIcfgContainer [2023-12-15 20:39:14,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:39:14,780 INFO L158 Benchmark]: Toolchain (without parser) took 3882.66ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 140.3MB in the beginning and 162.3MB in the end (delta: -22.0MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2023-12-15 20:39:14,780 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:39:14,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.17ms. Allocated memory is still 194.0MB. Free memory was 140.2MB in the beginning and 126.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 20:39:14,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 194.0MB. Free memory was 126.5MB in the beginning and 123.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:39:14,781 INFO L158 Benchmark]: Boogie Preprocessor took 53.70ms. Allocated memory is still 194.0MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:39:14,781 INFO L158 Benchmark]: RCFGBuilder took 377.16ms. Allocated memory is still 194.0MB. Free memory was 119.3MB in the beginning and 99.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 20:39:14,781 INFO L158 Benchmark]: TraceAbstraction took 3195.25ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 98.8MB in the beginning and 162.3MB in the end (delta: -63.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:39:14,782 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.17ms. Allocated memory is still 194.0MB. Free memory was 140.2MB in the beginning and 126.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 194.0MB. Free memory was 126.5MB in the beginning and 123.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.70ms. Allocated memory is still 194.0MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 377.16ms. Allocated memory is still 194.0MB. Free memory was 119.3MB in the beginning and 99.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3195.25ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 98.8MB in the beginning and 162.3MB in the end (delta: -63.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] float var_1_13 = 32.25; [L34] float var_1_14 = 15.5; [L35] float var_1_15 = 256.25; [L36] double var_1_16 = 8.6; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 [L112] RET updateLastVariables() [L113] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L93] var_1_15 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L47] COND FALSE !((var_1_13 / var_1_14) <= var_1_15) [L54] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L56] COND TRUE ((var_1_5 >= var_1_12) && var_1_2) && var_1_3 [L57] var_1_9 = (! var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16400, var_1_7=16383, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 264 IncrementalHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 185 mSDtfsCounter, 264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1804 SizeOfPredicates, 6 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4110/4200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:39:14,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...