/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:06:28,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:06:28,832 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-16 03:06:28,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:06:28,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:06:28,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:06:28,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:06:28,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:06:28,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:06:28,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:06:28,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:06:28,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:06:28,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:06:28,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:06:28,868 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:06:28,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:06:28,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:06:28,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:06:28,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:06:28,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:06:28,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:06:28,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:06:28,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:06:28,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:06:28,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:06:28,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:06:28,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:06:28,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:06:28,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:06:28,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:06:28,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:06:28,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:06:28,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:06:28,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:06:28,873 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:06:28,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:06:28,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:06:28,874 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 -> false [2023-12-16 03:06:29,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:06:29,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:06:29,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:06:29,116 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:06:29,118 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:06:29,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2023-12-16 03:06:30,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:06:30,361 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:06:30,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2023-12-16 03:06:30,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c0e52f4/73944aec327e41ebbf19566c45e9cfe0/FLAGcfab2ceef [2023-12-16 03:06:30,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c0e52f4/73944aec327e41ebbf19566c45e9cfe0 [2023-12-16 03:06:30,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:06:30,384 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:06:30,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:06:30,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:06:30,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:06:30,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d87860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30, skipping insertion in model container [2023-12-16 03:06:30,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,425 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:06:30,519 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_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2023-12-16 03:06:30,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:06:30,584 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:06:30,595 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_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2023-12-16 03:06:30,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:06:30,646 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:06:30,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30 WrapperNode [2023-12-16 03:06:30,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:06:30,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:06:30,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:06:30,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:06:30,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,690 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2023-12-16 03:06:30,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:06:30,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:06:30,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:06:30,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:06:30,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,716 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-16 03:06:30,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:06:30,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:06:30,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:06:30,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:06:30,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (1/1) ... [2023-12-16 03:06:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:06:30,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:06:30,781 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-16 03:06:30,805 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-16 03:06:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:06:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:06:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:06:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:06:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:06:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:06:30,923 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:06:30,925 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:06:31,215 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:06:31,260 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:06:31,260 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:06:31,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:06:31 BoogieIcfgContainer [2023-12-16 03:06:31,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:06:31,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:06:31,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:06:31,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:06:31,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:06:30" (1/3) ... [2023-12-16 03:06:31,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511896ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:06:31, skipping insertion in model container [2023-12-16 03:06:31,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:06:30" (2/3) ... [2023-12-16 03:06:31,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511896ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:06:31, skipping insertion in model container [2023-12-16 03:06:31,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:06:31" (3/3) ... [2023-12-16 03:06:31,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2023-12-16 03:06:31,307 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:06:31,307 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:06:31,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:06:31,347 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;@19612e0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:06:31,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:06:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.56) internal successors, (78), 51 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:06:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 03:06:31,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:31,361 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:31,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:31,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 137028977, now seen corresponding path program 1 times [2023-12-16 03:06:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138345990] [2023-12-16 03:06:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:06:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138345990] [2023-12-16 03:06:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138345990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:06:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:06:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:06:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174285498] [2023-12-16 03:06:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:06:31,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:06:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:06:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:06:31,834 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.56) internal successors, (78), 51 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-16 03:06:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:31,868 INFO L93 Difference]: Finished difference Result 151 states and 274 transitions. [2023-12-16 03:06:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:06:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2023-12-16 03:06:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:31,875 INFO L225 Difference]: With dead ends: 151 [2023-12-16 03:06:31,875 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 03:06:31,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-16 03:06:31,880 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:31,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:06:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 03:06:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-16 03:06:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:06:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 120 transitions. [2023-12-16 03:06:31,912 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 120 transitions. Word has length 153 [2023-12-16 03:06:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:31,912 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 120 transitions. [2023-12-16 03:06:31,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-16 03:06:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 120 transitions. [2023-12-16 03:06:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 03:06:31,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:31,915 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:31,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:06:31,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:31,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1427904497, now seen corresponding path program 1 times [2023-12-16 03:06:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280944498] [2023-12-16 03:06:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:06:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280944498] [2023-12-16 03:06:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280944498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:06:32,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:06:32,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:06:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800806344] [2023-12-16 03:06:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:06:32,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:06:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:06:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:06:32,217 INFO L87 Difference]: Start difference. First operand 75 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:06:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:32,301 INFO L93 Difference]: Finished difference Result 220 states and 352 transitions. [2023-12-16 03:06:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:06:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2023-12-16 03:06:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:32,307 INFO L225 Difference]: With dead ends: 220 [2023-12-16 03:06:32,307 INFO L226 Difference]: Without dead ends: 146 [2023-12-16 03:06:32,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-16 03:06:32,309 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 103 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:32,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 298 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:06:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-16 03:06:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 87. [2023-12-16 03:06:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 61 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:06:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 140 transitions. [2023-12-16 03:06:32,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 140 transitions. Word has length 153 [2023-12-16 03:06:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:32,330 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 140 transitions. [2023-12-16 03:06:32,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:06:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 140 transitions. [2023-12-16 03:06:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 03:06:32,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:32,335 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:32,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:06:32,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:32,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1485162799, now seen corresponding path program 1 times [2023-12-16 03:06:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342487156] [2023-12-16 03:06:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:06:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342487156] [2023-12-16 03:06:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342487156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:06:32,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:06:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:06:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21843642] [2023-12-16 03:06:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:06:32,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:06:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:06:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:06:32,868 INFO L87 Difference]: Start difference. First operand 87 states and 140 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:06:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:33,093 INFO L93 Difference]: Finished difference Result 260 states and 419 transitions. [2023-12-16 03:06:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:06:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2023-12-16 03:06:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:33,100 INFO L225 Difference]: With dead ends: 260 [2023-12-16 03:06:33,100 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 03:06:33,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:06:33,107 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 128 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:33,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 406 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:06:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 03:06:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 130. [2023-12-16 03:06:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:06:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 206 transitions. [2023-12-16 03:06:33,146 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 206 transitions. Word has length 153 [2023-12-16 03:06:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:33,147 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 206 transitions. [2023-12-16 03:06:33,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:06:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 206 transitions. [2023-12-16 03:06:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-16 03:06:33,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:33,152 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:33,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:06:33,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:33,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1999412600, now seen corresponding path program 1 times [2023-12-16 03:06:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212662102] [2023-12-16 03:06:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-16 03:06:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212662102] [2023-12-16 03:06:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212662102] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:06:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312236469] [2023-12-16 03:06:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:33,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:33,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:06:33,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:06:33,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:06:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:33,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 03:06:33,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:06:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 737 proven. 63 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-12-16 03:06:34,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:06:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-16 03:06:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312236469] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:06:34,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:06:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2023-12-16 03:06:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772754057] [2023-12-16 03:06:34,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:06:34,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 03:06:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 03:06:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-12-16 03:06:34,430 INFO L87 Difference]: Start difference. First operand 130 states and 206 transitions. Second operand has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 6 states have call successors, (60), 3 states have call predecessors, (60), 7 states have return successors, (62), 6 states have call predecessors, (62), 6 states have call successors, (62) [2023-12-16 03:06:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:35,517 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2023-12-16 03:06:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-16 03:06:35,517 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 6 states have call successors, (60), 3 states have call predecessors, (60), 7 states have return successors, (62), 6 states have call predecessors, (62), 6 states have call successors, (62) Word has length 154 [2023-12-16 03:06:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:35,518 INFO L225 Difference]: With dead ends: 349 [2023-12-16 03:06:35,519 INFO L226 Difference]: Without dead ends: 263 [2023-12-16 03:06:35,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2023-12-16 03:06:35,521 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 467 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:35,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 276 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 03:06:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-16 03:06:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2023-12-16 03:06:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 136 states have (on average 1.1691176470588236) internal successors, (159), 138 states have internal predecessors, (159), 71 states have call successors, (71), 18 states have call predecessors, (71), 18 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2023-12-16 03:06:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 301 transitions. [2023-12-16 03:06:35,546 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 301 transitions. Word has length 154 [2023-12-16 03:06:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:35,546 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 301 transitions. [2023-12-16 03:06:35,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 18 states have internal predecessors, (109), 6 states have call successors, (60), 3 states have call predecessors, (60), 7 states have return successors, (62), 6 states have call predecessors, (62), 6 states have call successors, (62) [2023-12-16 03:06:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 301 transitions. [2023-12-16 03:06:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 03:06:35,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:35,548 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:35,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:06:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:35,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:35,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1685086379, now seen corresponding path program 1 times [2023-12-16 03:06:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510311096] [2023-12-16 03:06:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-16 03:06:36,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510311096] [2023-12-16 03:06:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510311096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:06:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606861293] [2023-12-16 03:06:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:06:36,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:06:36,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 03:06:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:36,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 03:06:36,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:06:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 779 proven. 78 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-16 03:06:36,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:06:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 87 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2023-12-16 03:06:37,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606861293] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:06:37,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:06:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 28 [2023-12-16 03:06:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555975963] [2023-12-16 03:06:37,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:06:37,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 03:06:37,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 03:06:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2023-12-16 03:06:37,215 INFO L87 Difference]: Start difference. First operand 226 states and 301 transitions. Second operand has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (54), 4 states have call predecessors, (54), 10 states have return successors, (55), 9 states have call predecessors, (55), 9 states have call successors, (55) [2023-12-16 03:06:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:38,029 INFO L93 Difference]: Finished difference Result 544 states and 684 transitions. [2023-12-16 03:06:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-16 03:06:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (54), 4 states have call predecessors, (54), 10 states have return successors, (55), 9 states have call predecessors, (55), 9 states have call successors, (55) Word has length 156 [2023-12-16 03:06:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:38,035 INFO L225 Difference]: With dead ends: 544 [2023-12-16 03:06:38,035 INFO L226 Difference]: Without dead ends: 382 [2023-12-16 03:06:38,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=811, Invalid=1739, Unknown=0, NotChecked=0, Total=2550 [2023-12-16 03:06:38,037 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 345 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:38,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 368 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 03:06:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-16 03:06:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 277. [2023-12-16 03:06:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 176 states have (on average 1.1590909090909092) internal successors, (204), 178 states have internal predecessors, (204), 71 states have call successors, (71), 29 states have call predecessors, (71), 29 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2023-12-16 03:06:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 346 transitions. [2023-12-16 03:06:38,080 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 346 transitions. Word has length 156 [2023-12-16 03:06:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:38,083 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 346 transitions. [2023-12-16 03:06:38,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.321428571428571) internal successors, (121), 28 states have internal predecessors, (121), 9 states have call successors, (54), 4 states have call predecessors, (54), 10 states have return successors, (55), 9 states have call predecessors, (55), 9 states have call successors, (55) [2023-12-16 03:06:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 346 transitions. [2023-12-16 03:06:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 03:06:38,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:38,084 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:38,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 03:06:38,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:38,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:38,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1106336622, now seen corresponding path program 1 times [2023-12-16 03:06:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302630614] [2023-12-16 03:06:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:06:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:06:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:06:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:06:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:06:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:06:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:06:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:06:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:06:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:06:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:06:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:06:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:06:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:06:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:06:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:06:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:06:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:06:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:06:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:06:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-16 03:06:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:06:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:06:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-16 03:06:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-12-16 03:06:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:06:38,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302630614] [2023-12-16 03:06:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302630614] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:06:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181488826] [2023-12-16 03:06:38,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:38,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:06:38,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:06:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 03:06:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:06:38,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 03:06:38,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:06:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 743 proven. 111 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-16 03:06:39,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:06:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 78 proven. 120 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2023-12-16 03:06:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181488826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:06:39,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:06:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 13] total 31 [2023-12-16 03:06:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442720691] [2023-12-16 03:06:39,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:06:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-16 03:06:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:06:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-16 03:06:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2023-12-16 03:06:39,717 INFO L87 Difference]: Start difference. First operand 277 states and 346 transitions. Second operand has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 11 states have call successors, (58), 5 states have call predecessors, (58), 11 states have return successors, (59), 10 states have call predecessors, (59), 11 states have call successors, (59) [2023-12-16 03:06:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:06:40,479 INFO L93 Difference]: Finished difference Result 502 states and 617 transitions. [2023-12-16 03:06:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 03:06:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 11 states have call successors, (58), 5 states have call predecessors, (58), 11 states have return successors, (59), 10 states have call predecessors, (59), 11 states have call successors, (59) Word has length 156 [2023-12-16 03:06:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:06:40,481 INFO L225 Difference]: With dead ends: 502 [2023-12-16 03:06:40,481 INFO L226 Difference]: Without dead ends: 305 [2023-12-16 03:06:40,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=723, Invalid=1929, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 03:06:40,482 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 424 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 03:06:40,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 415 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 03:06:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-16 03:06:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 263. [2023-12-16 03:06:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 168 states have internal predecessors, (189), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-16 03:06:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 319 transitions. [2023-12-16 03:06:40,513 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 319 transitions. Word has length 156 [2023-12-16 03:06:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:06:40,513 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 319 transitions. [2023-12-16 03:06:40,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 31 states have internal predecessors, (122), 11 states have call successors, (58), 5 states have call predecessors, (58), 11 states have return successors, (59), 10 states have call predecessors, (59), 11 states have call successors, (59) [2023-12-16 03:06:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 319 transitions. [2023-12-16 03:06:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 03:06:40,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:06:40,514 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:06:40,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 03:06:40,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:06:40,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:06:40,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:06:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1005028009, now seen corresponding path program 1 times [2023-12-16 03:06:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:06:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505777089] [2023-12-16 03:06:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:06:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:06:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:06:40,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:06:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:06:40,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:06:40,957 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:06:40,958 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:06:40,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:06:40,961 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:06:40,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:06:41,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:06:41 BoogieIcfgContainer [2023-12-16 03:06:41,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:06:41,063 INFO L158 Benchmark]: Toolchain (without parser) took 10679.43ms. Allocated memory was 205.5MB in the beginning and 427.8MB in the end (delta: 222.3MB). Free memory was 157.6MB in the beginning and 224.7MB in the end (delta: -67.2MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,063 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 205.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:06:41,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.86ms. Allocated memory is still 205.5MB. Free memory was 157.2MB in the beginning and 142.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 205.5MB. Free memory was 142.5MB in the beginning and 140.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,064 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 205.5MB. Free memory was 140.0MB in the beginning and 136.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,064 INFO L158 Benchmark]: RCFGBuilder took 519.46ms. Allocated memory is still 205.5MB. Free memory was 136.6MB in the beginning and 113.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,064 INFO L158 Benchmark]: TraceAbstraction took 9800.84ms. Allocated memory was 205.5MB in the beginning and 427.8MB in the end (delta: 222.3MB). Free memory was 112.5MB in the beginning and 224.7MB in the end (delta: -112.3MB). Peak memory consumption was 111.5MB. Max. memory is 8.0GB. [2023-12-16 03:06:41,066 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.42ms. Allocated memory is still 205.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.86ms. Allocated memory is still 205.5MB. Free memory was 157.2MB in the beginning and 142.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 205.5MB. Free memory was 142.5MB in the beginning and 140.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 205.5MB. Free memory was 140.0MB in the beginning and 136.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.46ms. Allocated memory is still 205.5MB. Free memory was 136.6MB in the beginning and 113.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 9800.84ms. Allocated memory was 205.5MB in the beginning and 427.8MB in the end (delta: 222.3MB). Free memory was 112.5MB in the beginning and 224.7MB in the end (delta: -112.3MB). Peak memory consumption was 111.5MB. 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 170, overapproximation of someUnaryDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of bitwise operation at line 115, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L192] RET updateVariables() [L193] CALL step() [L55] unsigned long int stepLocal_1 = last_1_var_1_16; [L56] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L57] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L58] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=8, var_1_8=2, var_1_9=126] [L66] COND TRUE var_1_12 == var_1_12 [L67] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L69] var_1_1 = (var_1_2 || (! var_1_3)) [L70] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L71] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L72] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L73] COND FALSE !(var_1_19 >= var_1_19) [L78] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=1, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L83] COND TRUE var_1_19 != var_1_19 [L84] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L92] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L93] COND FALSE !((var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L96] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L97] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L104] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L104] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) [L104] EXPR var_1_12 >> var_1_7 [L104] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L104] COND TRUE var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)))) [L105] var_1_25 = (var_1_27 - var_1_7) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L111] COND TRUE \read(var_1_1) [L112] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L114] COND TRUE var_1_9 >= var_1_8 [L115] EXPR var_1_27 >> (var_1_34 + var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L115] COND FALSE !((var_1_27 >> (var_1_34 + var_1_35)) <= var_1_7) [L124] var_1_33 = var_1_20 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=7/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L127] COND FALSE !(var_1_27 >= (var_1_9 + var_1_9)) [L136] var_1_36 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, stepLocal_2=1, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=7/5, var_1_34=5, var_1_35=4, var_1_36=126, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=7/5, var_1_34=5, var_1_35=4, var_1_36=126, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543170, var_1_11=2147483647, var_1_12=8, var_1_15=8, var_1_16=10, var_1_17=4294967294, var_1_18=2147483647, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=119, var_1_27=127, var_1_2=0, var_1_30=7/5, var_1_33=7/5, var_1_34=5, var_1_35=4, var_1_36=126, var_1_3=0, var_1_4=-110, var_1_7=8, var_1_8=2, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1477 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1467 mSDsluCounter, 1880 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1230 mSDsCounter, 748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1869 IncrementalHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 748 mSolverCounterUnsat, 650 mSDtfsCounter, 1869 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1383 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=5, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 287 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1547 NumberOfCodeBlocks, 1547 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1845 ConstructedInterpolants, 0 QuantifiedInterpolants, 7500 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1136 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 12567/13248 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-16 03:06:41,090 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...