/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_codestructure_dependencies_file-27.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 19:30:58,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 19:30:58,230 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 19:30:58,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 19:30:58,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 19:30:58,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 19:30:58,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 19:30:58,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 19:30:58,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 19:30:58,261 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 19:30:58,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 19:30:58,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 19:30:58,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 19:30:58,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 19:30:58,263 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 19:30:58,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 19:30:58,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 19:30:58,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 19:30:58,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 19:30:58,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 19:30:58,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 19:30:58,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 19:30:58,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 19:30:58,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 19:30:58,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 19:30:58,265 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 19:30:58,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 19:30:58,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 19:30:58,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 19:30:58,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 19:30:58,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 19:30:58,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 19:30:58,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:30:58,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 19:30:58,268 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 19:30:58,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 19:30:58,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 19:30:58,269 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 19:30:58,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 19:30:58,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 19:30:58,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 19:30:58,466 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 19:30:58,467 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 19:30:58,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-12-15 19:30:59,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 19:30:59,696 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 19:30:59,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-12-15 19:30:59,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c419692/45803e255eb94a78a7105964a9041ccb/FLAG5b0308cd0 [2023-12-15 19:30:59,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c419692/45803e255eb94a78a7105964a9041ccb [2023-12-15 19:30:59,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 19:30:59,715 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 19:30:59,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 19:30:59,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 19:30:59,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 19:30:59,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:30:59,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47cc6fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59, skipping insertion in model container [2023-12-15 19:30:59,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:30:59,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 19:30:59,867 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_codestructure_dependencies_file-27.i[919,932] [2023-12-15 19:30:59,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:30:59,932 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 19:30:59,944 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_codestructure_dependencies_file-27.i[919,932] [2023-12-15 19:30:59,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 19:30:59,996 INFO L206 MainTranslator]: Completed translation [2023-12-15 19:30:59,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59 WrapperNode [2023-12-15 19:30:59,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 19:31:00,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 19:31:00,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 19:31:00,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 19:31:00,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,049 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2023-12-15 19:31:00,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 19:31:00,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 19:31:00,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 19:31:00,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 19:31:00,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,077 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 19:31:00,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 19:31:00,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 19:31:00,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 19:31:00,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 19:31:00,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (1/1) ... [2023-12-15 19:31:00,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 19:31:00,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 19:31:00,133 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 19:31:00,151 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 19:31:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 19:31:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 19:31:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 19:31:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 19:31:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 19:31:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 19:31:00,243 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 19:31:00,246 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 19:31:00,487 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 19:31:00,517 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 19:31:00,517 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 19:31:00,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:31:00 BoogieIcfgContainer [2023-12-15 19:31:00,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 19:31:00,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 19:31:00,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 19:31:00,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 19:31:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 07:30:59" (1/3) ... [2023-12-15 19:31:00,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aa99cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:31:00, skipping insertion in model container [2023-12-15 19:31:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 07:30:59" (2/3) ... [2023-12-15 19:31:00,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aa99cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 07:31:00, skipping insertion in model container [2023-12-15 19:31:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 07:31:00" (3/3) ... [2023-12-15 19:31:00,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2023-12-15 19:31:00,538 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 19:31:00,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 19:31:00,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 19:31:00,572 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;@7e811a64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 19:31:00,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 19:31:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 19:31:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 19:31:00,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:31:00,590 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1] [2023-12-15 19:31:00,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:31:00,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:31:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 96445642, now seen corresponding path program 1 times [2023-12-15 19:31:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:31:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312486890] [2023-12-15 19:31:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:31:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:31:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:31:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:31:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:31:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:31:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:31:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 19:31:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 19:31:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 19:31:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 19:31:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 19:31:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 19:31:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:31:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:31:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:31:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:31:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:31:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:31:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 19:31:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 19:31:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 19:31:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 19:31:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:31:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312486890] [2023-12-15 19:31:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312486890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:31:00,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:31:00,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 19:31:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700834649] [2023-12-15 19:31:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:31:00,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 19:31:00,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:31:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 19:31:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 19:31:00,926 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 19:31:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:31:00,979 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2023-12-15 19:31:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 19:31:00,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2023-12-15 19:31:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:31:00,988 INFO L225 Difference]: With dead ends: 119 [2023-12-15 19:31:00,988 INFO L226 Difference]: Without dead ends: 59 [2023-12-15 19:31:00,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 19:31:00,995 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:31:00,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 19:31:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-15 19:31:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-15 19:31:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 19:31:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-12-15 19:31:01,026 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 126 [2023-12-15 19:31:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:31:01,026 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-12-15 19:31:01,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 19:31:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-12-15 19:31:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 19:31:01,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:31:01,029 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1] [2023-12-15 19:31:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 19:31:01,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:31:01,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:31:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -501764414, now seen corresponding path program 1 times [2023-12-15 19:31:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:31:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064865188] [2023-12-15 19:31:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:31:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:31:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:31:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:31:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:31:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:31:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:31:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 19:31:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 19:31:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 19:31:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 19:31:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 19:31:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 19:31:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:31:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:31:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:31:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:31:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:31:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:31:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 19:31:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 19:31:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 19:31:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 19:31:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:31:01,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064865188] [2023-12-15 19:31:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064865188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:31:01,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:31:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 19:31:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280113641] [2023-12-15 19:31:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:31:01,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 19:31:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:31:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 19:31:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:31:01,425 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:31:01,484 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2023-12-15 19:31:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 19:31:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2023-12-15 19:31:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:31:01,489 INFO L225 Difference]: With dead ends: 175 [2023-12-15 19:31:01,489 INFO L226 Difference]: Without dead ends: 117 [2023-12-15 19:31:01,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 19:31:01,492 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 19:31:01,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 19:31:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-15 19:31:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-12-15 19:31:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 19:31:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2023-12-15 19:31:01,515 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 126 [2023-12-15 19:31:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:31:01,516 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2023-12-15 19:31:01,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2023-12-15 19:31:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 19:31:01,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:31:01,521 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1] [2023-12-15 19:31:01,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 19:31:01,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:31:01,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:31:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 232534288, now seen corresponding path program 1 times [2023-12-15 19:31:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:31:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975437640] [2023-12-15 19:31:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:31:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:31:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:31:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:31:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:31:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:31:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:31:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 19:31:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 19:31:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 19:31:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 19:31:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 19:31:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 19:31:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:31:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:31:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:31:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:31:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:31:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:31:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 19:31:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 19:31:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 19:31:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 19:31:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:31:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975437640] [2023-12-15 19:31:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975437640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:31:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:31:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 19:31:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385205400] [2023-12-15 19:31:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:31:01,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 19:31:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:31:01,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 19:31:01,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 19:31:01,866 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:31:01,981 INFO L93 Difference]: Finished difference Result 227 states and 351 transitions. [2023-12-15 19:31:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 19:31:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-12-15 19:31:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:31:01,986 INFO L225 Difference]: With dead ends: 227 [2023-12-15 19:31:01,986 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 19:31:01,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 19:31:01,991 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 89 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 19:31:01,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 19:31:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 19:31:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-15 19:31:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 19:31:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2023-12-15 19:31:02,017 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 127 [2023-12-15 19:31:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:31:02,018 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2023-12-15 19:31:02,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2023-12-15 19:31:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 19:31:02,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:31:02,019 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1] [2023-12-15 19:31:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 19:31:02,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:31:02,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:31:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash 933598866, now seen corresponding path program 1 times [2023-12-15 19:31:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:31:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423305620] [2023-12-15 19:31:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:31:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:31:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 19:31:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 19:31:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 19:31:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 19:31:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 19:31:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 19:31:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 19:31:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 19:31:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 19:31:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 19:31:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 19:31:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 19:31:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 19:31:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 19:31:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 19:31:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 19:31:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 19:31:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 19:31:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 19:31:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 19:31:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 19:31:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 19:31:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 19:31:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423305620] [2023-12-15 19:31:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423305620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 19:31:02,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 19:31:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 19:31:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960203076] [2023-12-15 19:31:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 19:31:02,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 19:31:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 19:31:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 19:31:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 19:31:02,202 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 19:31:02,307 INFO L93 Difference]: Finished difference Result 229 states and 351 transitions. [2023-12-15 19:31:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 19:31:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-12-15 19:31:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 19:31:02,310 INFO L225 Difference]: With dead ends: 229 [2023-12-15 19:31:02,310 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 19:31:02,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 19:31:02,315 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 88 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 19:31:02,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 19:31:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 19:31:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-12-15 19:31:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 19:31:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2023-12-15 19:31:02,337 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 127 [2023-12-15 19:31:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 19:31:02,338 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2023-12-15 19:31:02,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 19:31:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2023-12-15 19:31:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 19:31:02,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 19:31:02,340 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1, 1, 1, 1] [2023-12-15 19:31:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 19:31:02,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 19:31:02,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 19:31:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996711, now seen corresponding path program 1 times [2023-12-15 19:31:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 19:31:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363299501] [2023-12-15 19:31:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 19:31:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 19:31:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:31:02,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 19:31:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 19:31:02,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 19:31:02,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 19:31:02,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 19:31:02,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 19:31:02,509 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 19:31:02,512 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 19:31:02,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 07:31:02 BoogieIcfgContainer [2023-12-15 19:31:02,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 19:31:02,580 INFO L158 Benchmark]: Toolchain (without parser) took 2864.60ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 158.1MB in the beginning and 133.6MB in the end (delta: 24.5MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,580 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 194.0MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 19:31:02,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.09ms. Allocated memory is still 194.0MB. Free memory was 158.1MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.64ms. Allocated memory is still 194.0MB. Free memory was 144.5MB in the beginning and 141.3MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,580 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 194.0MB. Free memory was 141.3MB in the beginning and 137.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,580 INFO L158 Benchmark]: RCFGBuilder took 427.93ms. Allocated memory is still 194.0MB. Free memory was 137.7MB in the beginning and 116.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,581 INFO L158 Benchmark]: TraceAbstraction took 2060.55ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 115.7MB in the beginning and 133.6MB in the end (delta: -17.9MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. [2023-12-15 19:31:02,582 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.47ms. Allocated memory is still 194.0MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.09ms. Allocated memory is still 194.0MB. Free memory was 158.1MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.64ms. Allocated memory is still 194.0MB. Free memory was 144.5MB in the beginning and 141.3MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 194.0MB. Free memory was 141.3MB in the beginning and 137.7MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 427.93ms. Allocated memory is still 194.0MB. Free memory was 137.7MB in the beginning and 116.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2060.55ms. Allocated memory was 194.0MB in the beginning and 288.4MB in the end (delta: 94.4MB). Free memory was 115.7MB in the beginning and 133.6MB in the end (delta: -17.9MB). Peak memory consumption was 77.4MB. 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 123, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] FCALL updateLastVariables() [L131] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L95] var_1_5 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L96] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L97] var_1_6 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L98] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L100] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] 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, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L105] 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, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L107] var_1_15 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L108] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L111] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L116] var_1_19 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L46] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L48] var_1_20 = var_1_11 [L49] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L51] COND TRUE var_1_12 != var_1_21 [L52] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L57] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L68] COND TRUE var_1_14 || var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L69] COND TRUE var_1_14 || var_1_14 [L70] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L77] COND FALSE !(var_1_6 > (- var_1_7)) [L82] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=0] [L84] var_1_22 = var_1_8 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L123-L124] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 332 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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 19:31:02,619 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...