/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-ps-ci_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:23:27,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:23:27,493 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-20 21:23:27,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:23:27,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:23:27,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:23:27,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:23:27,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:23:27,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:23:27,527 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:23:27,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:23:27,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:23:27,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:23:27,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:23:27,529 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:23:27,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:23:27,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:23:27,529 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:23:27,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:23:27,531 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:23:27,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:23:27,531 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:23:27,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:23:27,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:23:27,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:23:27,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:23:27,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:23:27,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:23:27,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:23:27,533 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-20 21:23:27,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:23:27,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:23:27,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:23:27,715 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:23:27,716 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:23:27,716 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-ps-ci_file-11.i [2023-12-20 21:23:28,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:23:28,799 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:23:28,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2023-12-20 21:23:28,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a087f52d/3ae0d1ddc44346de9d2cb1102e48de51/FLAG90dfce26c [2023-12-20 21:23:28,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a087f52d/3ae0d1ddc44346de9d2cb1102e48de51 [2023-12-20 21:23:28,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:23:28,817 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:23:28,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:23:28,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:23:28,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:23:28,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:23:28" (1/1) ... [2023-12-20 21:23:28,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1ef670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:28, skipping insertion in model container [2023-12-20 21:23:28,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:23:28" (1/1) ... [2023-12-20 21:23:28,844 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:23:28,960 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-ps-ci_file-11.i[919,932] [2023-12-20 21:23:29,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:23:29,015 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:23:29,023 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-ps-ci_file-11.i[919,932] [2023-12-20 21:23:29,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:23:29,066 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:23:29,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29 WrapperNode [2023-12-20 21:23:29,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:23:29,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:23:29,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:23:29,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:23:29,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,109 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2023-12-20 21:23:29,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:23:29,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:23:29,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:23:29,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:23:29,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,143 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-20 21:23:29,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:23:29,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:23:29,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:23:29,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:23:29,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (1/1) ... [2023-12-20 21:23:29,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:23:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:23:29,185 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-20 21:23:29,196 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-20 21:23:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:23:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:23:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:23:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:23:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:23:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:23:29,302 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:23:29,304 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:23:29,593 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:23:29,621 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:23:29,621 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:23:29,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:23:29 BoogieIcfgContainer [2023-12-20 21:23:29,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:23:29,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:23:29,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:23:29,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:23:29,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:23:28" (1/3) ... [2023-12-20 21:23:29,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59477886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:23:29, skipping insertion in model container [2023-12-20 21:23:29,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:23:29" (2/3) ... [2023-12-20 21:23:29,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59477886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:23:29, skipping insertion in model container [2023-12-20 21:23:29,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:23:29" (3/3) ... [2023-12-20 21:23:29,627 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2023-12-20 21:23:29,639 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:23:29,639 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:23:29,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:23:29,684 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;@223a1ab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:23:29,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:23:29,688 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-20 21:23:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-20 21:23:29,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:29,704 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-20 21:23:29,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1416200013, now seen corresponding path program 1 times [2023-12-20 21:23:29,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294543218] [2023-12-20 21:23:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,048 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-20 21:23:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294543218] [2023-12-20 21:23:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294543218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:23:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:23:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:23:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087195207] [2023-12-20 21:23:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:23:30,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:23:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:23:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:23:30,072 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-20 21:23:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:30,120 INFO L93 Difference]: Finished difference Result 151 states and 274 transitions. [2023-12-20 21:23:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:23:30,122 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-20 21:23:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:30,128 INFO L225 Difference]: With dead ends: 151 [2023-12-20 21:23:30,128 INFO L226 Difference]: Without dead ends: 75 [2023-12-20 21:23:30,132 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-20 21:23:30,136 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-20 21:23:30,137 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-20 21:23:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-20 21:23:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-20 21:23:30,174 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-20 21:23:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 120 transitions. [2023-12-20 21:23:30,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 120 transitions. Word has length 153 [2023-12-20 21:23:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:30,176 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 120 transitions. [2023-12-20 21:23:30,176 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-20 21:23:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 120 transitions. [2023-12-20 21:23:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-20 21:23:30,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:30,178 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-20 21:23:30,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 21:23:30,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:30,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash -125324493, now seen corresponding path program 1 times [2023-12-20 21:23:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238252254] [2023-12-20 21:23:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,025 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-20 21:23:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238252254] [2023-12-20 21:23:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238252254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:23:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:23:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 21:23:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771195241] [2023-12-20 21:23:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:23:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 21:23:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 21:23:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:23:31,034 INFO L87 Difference]: Start difference. First operand 75 states and 120 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-20 21:23:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:31,117 INFO L93 Difference]: Finished difference Result 159 states and 252 transitions. [2023-12-20 21:23:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 21:23:31,118 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-20 21:23:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:31,121 INFO L225 Difference]: With dead ends: 159 [2023-12-20 21:23:31,121 INFO L226 Difference]: Without dead ends: 85 [2023-12-20 21:23:31,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:23:31,124 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:23:31,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 408 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:23:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-20 21:23:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-20 21:23:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 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-20 21:23:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2023-12-20 21:23:31,140 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 126 transitions. Word has length 153 [2023-12-20 21:23:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:31,142 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 126 transitions. [2023-12-20 21:23:31,142 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-20 21:23:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 126 transitions. [2023-12-20 21:23:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-20 21:23:31,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:31,148 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-20 21:23:31,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 21:23:31,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:31,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -125264911, now seen corresponding path program 1 times [2023-12-20 21:23:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:31,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890408796] [2023-12-20 21:23:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:31,501 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-20 21:23:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890408796] [2023-12-20 21:23:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890408796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:23:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:23:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 21:23:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237673823] [2023-12-20 21:23:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:23:31,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 21:23:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 21:23:31,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 21:23:31,510 INFO L87 Difference]: Start difference. First operand 79 states and 126 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-20 21:23:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:31,709 INFO L93 Difference]: Finished difference Result 236 states and 377 transitions. [2023-12-20 21:23:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 21:23:31,710 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-20 21:23:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:31,714 INFO L225 Difference]: With dead ends: 236 [2023-12-20 21:23:31,714 INFO L226 Difference]: Without dead ends: 158 [2023-12-20 21:23:31,716 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-20 21:23:31,718 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 120 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:23:31,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 405 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:23:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-20 21:23:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2023-12-20 21:23:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 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-20 21:23:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 220 transitions. [2023-12-20 21:23:31,748 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 220 transitions. Word has length 153 [2023-12-20 21:23:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:31,748 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 220 transitions. [2023-12-20 21:23:31,748 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-20 21:23:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2023-12-20 21:23:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-20 21:23:31,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:31,749 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-20 21:23:31,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 21:23:31,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:31,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 731987776, now seen corresponding path program 1 times [2023-12-20 21:23:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214631697] [2023-12-20 21:23:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,156 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-20 21:23:32,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:32,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214631697] [2023-12-20 21:23:32,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214631697] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:23:32,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904958052] [2023-12-20 21:23:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:32,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:23:32,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:23:32,159 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-20 21:23:32,178 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-20 21:23:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:32,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-20 21:23:32,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:23:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2023-12-20 21:23:32,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:23:32,997 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-20 21:23:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904958052] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:23:32,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:23:32,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2023-12-20 21:23:32,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056735225] [2023-12-20 21:23:32,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:23:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 21:23:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 21:23:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-20 21:23:33,001 INFO L87 Difference]: Start difference. First operand 137 states and 220 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2023-12-20 21:23:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:33,169 INFO L93 Difference]: Finished difference Result 237 states and 371 transitions. [2023-12-20 21:23:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 21:23:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 154 [2023-12-20 21:23:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:33,171 INFO L225 Difference]: With dead ends: 237 [2023-12-20 21:23:33,171 INFO L226 Difference]: Without dead ends: 149 [2023-12-20 21:23:33,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2023-12-20 21:23:33,176 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 190 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 21:23:33,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 196 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 21:23:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-20 21:23:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2023-12-20 21:23:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 21:23:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2023-12-20 21:23:33,203 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 154 [2023-12-20 21:23:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:33,204 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2023-12-20 21:23:33,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2023-12-20 21:23:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2023-12-20 21:23:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-20 21:23:33,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:33,207 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] [2023-12-20 21:23:33,219 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-20 21:23:33,415 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-20 21:23:33,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:33,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash 404917336, now seen corresponding path program 1 times [2023-12-20 21:23:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734365324] [2023-12-20 21:23:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 90 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-12-20 21:23:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734365324] [2023-12-20 21:23:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734365324] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:23:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389988599] [2023-12-20 21:23:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:34,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:23:34,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:23:34,040 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-20 21:23:34,060 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-20 21:23:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:34,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 21:23:34,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:23:34,380 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-20 21:23:34,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:23:34,615 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-20 21:23:34,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389988599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:23:34,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:23:34,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 25 [2023-12-20 21:23:34,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254107315] [2023-12-20 21:23:34,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:23:34,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-20 21:23:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-20 21:23:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2023-12-20 21:23:34,618 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 10 states have call predecessors, (65), 10 states have call successors, (65) [2023-12-20 21:23:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:38,993 INFO L93 Difference]: Finished difference Result 1045 states and 1364 transitions. [2023-12-20 21:23:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2023-12-20 21:23:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 10 states have call predecessors, (65), 10 states have call successors, (65) Word has length 155 [2023-12-20 21:23:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:38,998 INFO L225 Difference]: With dead ends: 1045 [2023-12-20 21:23:38,998 INFO L226 Difference]: Without dead ends: 953 [2023-12-20 21:23:39,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9684 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4635, Invalid=19235, Unknown=0, NotChecked=0, Total=23870 [2023-12-20 21:23:39,003 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 3218 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3237 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 21:23:39,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3237 Valid, 661 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 21:23:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2023-12-20 21:23:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 578. [2023-12-20 21:23:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 414 states have (on average 1.3019323671497585) internal successors, (539), 422 states have internal predecessors, (539), 126 states have call successors, (126), 37 states have call predecessors, (126), 37 states have return successors, (126), 118 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-20 21:23:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 791 transitions. [2023-12-20 21:23:39,059 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 791 transitions. Word has length 155 [2023-12-20 21:23:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:39,059 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 791 transitions. [2023-12-20 21:23:39,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 10 states have call predecessors, (65), 10 states have call successors, (65) [2023-12-20 21:23:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 791 transitions. [2023-12-20 21:23:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-20 21:23:39,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:39,061 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-20 21:23:39,068 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-20 21:23:39,266 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-20 21:23:39,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:39,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash 211917760, now seen corresponding path program 1 times [2023-12-20 21:23:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367927898] [2023-12-20 21:23:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:23:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:23:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:23:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:23:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:23:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:23:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:23:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:23:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:23:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 21:23:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 21:23:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 21:23:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 21:23:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 21:23:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 21:23:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 21:23:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 21:23:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 21:23:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 21:23:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 21:23:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 21:23:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 21:23:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 21:23:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 21:23:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,577 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-20 21:23:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:23:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367927898] [2023-12-20 21:23:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367927898] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 21:23:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383626716] [2023-12-20 21:23:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:23:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:23:39,579 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-20 21:23:39,602 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-20 21:23:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:23:39,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-20 21:23:39,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:23:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 780 proven. 69 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-12-20 21:23:40,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:23:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-12-20 21:23:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383626716] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 21:23:40,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 21:23:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2023-12-20 21:23:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540194812] [2023-12-20 21:23:40,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 21:23:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-20 21:23:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:23:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-20 21:23:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2023-12-20 21:23:40,517 INFO L87 Difference]: Start difference. First operand 578 states and 791 transitions. Second operand has 26 states, 25 states have (on average 3.88) internal successors, (97), 26 states have internal predecessors, (97), 10 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) [2023-12-20 21:23:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:23:41,277 INFO L93 Difference]: Finished difference Result 1180 states and 1576 transitions. [2023-12-20 21:23:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 21:23:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.88) internal successors, (97), 26 states have internal predecessors, (97), 10 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) Word has length 156 [2023-12-20 21:23:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:23:41,281 INFO L225 Difference]: With dead ends: 1180 [2023-12-20 21:23:41,281 INFO L226 Difference]: Without dead ends: 683 [2023-12-20 21:23:41,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1373, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 21:23:41,283 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 496 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 21:23:41,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 447 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 21:23:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-20 21:23:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 504. [2023-12-20 21:23:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 351 states have (on average 1.2535612535612535) internal successors, (440), 355 states have internal predecessors, (440), 110 states have call successors, (110), 42 states have call predecessors, (110), 42 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-20 21:23:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 660 transitions. [2023-12-20 21:23:41,322 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 660 transitions. Word has length 156 [2023-12-20 21:23:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:23:41,322 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 660 transitions. [2023-12-20 21:23:41,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.88) internal successors, (97), 26 states have internal predecessors, (97), 10 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 9 states have call predecessors, (60), 10 states have call successors, (60) [2023-12-20 21:23:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 660 transitions. [2023-12-20 21:23:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-20 21:23:41,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:23:41,324 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-20 21:23:41,332 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-20 21:23:41,529 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-20 21:23:41,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:23:41,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:23:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1477025982, now seen corresponding path program 1 times [2023-12-20 21:23:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:23:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734470818] [2023-12-20 21:23:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:23:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:23:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:23:41,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:23:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:23:41,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:23:41,800 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:23:41,800 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:23:41,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 21:23:41,803 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:23:41,806 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:23:41,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:23:41 BoogieIcfgContainer [2023-12-20 21:23:41,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:23:41,895 INFO L158 Benchmark]: Toolchain (without parser) took 13078.56ms. Allocated memory was 420.5MB in the beginning and 704.6MB in the end (delta: 284.2MB). Free memory was 366.8MB in the beginning and 344.4MB in the end (delta: 22.4MB). Peak memory consumption was 307.4MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,895 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:23:41,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.65ms. Allocated memory is still 420.5MB. Free memory was 366.5MB in the beginning and 351.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.85ms. Allocated memory is still 420.5MB. Free memory was 351.9MB in the beginning and 349.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,896 INFO L158 Benchmark]: Boogie Preprocessor took 54.06ms. Allocated memory is still 420.5MB. Free memory was 349.0MB in the beginning and 345.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,896 INFO L158 Benchmark]: RCFGBuilder took 457.05ms. Allocated memory is still 420.5MB. Free memory was 345.8MB in the beginning and 375.5MB in the end (delta: -29.7MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,896 INFO L158 Benchmark]: TraceAbstraction took 12271.84ms. Allocated memory was 420.5MB in the beginning and 704.6MB in the end (delta: 284.2MB). Free memory was 375.0MB in the beginning and 344.4MB in the end (delta: 30.6MB). Peak memory consumption was 315.3MB. Max. memory is 8.0GB. [2023-12-20 21:23:41,898 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.10ms. Allocated memory is still 255.9MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.65ms. Allocated memory is still 420.5MB. Free memory was 366.5MB in the beginning and 351.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.85ms. Allocated memory is still 420.5MB. Free memory was 351.9MB in the beginning and 349.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.06ms. Allocated memory is still 420.5MB. Free memory was 349.0MB in the beginning and 345.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 457.05ms. Allocated memory is still 420.5MB. Free memory was 345.8MB in the beginning and 375.5MB in the end (delta: -29.7MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * TraceAbstraction took 12271.84ms. Allocated memory was 420.5MB in the beginning and 704.6MB in the end (delta: 284.2MB). Free memory was 375.0MB in the beginning and 344.4MB in the end (delta: 30.6MB). Peak memory consumption was 315.3MB. 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 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of bitwise operation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 71. 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=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] [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=0, 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=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] [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var_1_8=2, var_1_9=0] [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=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=2, var_1_9=0] [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=4294967294, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=2, var_1_9=0] [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=4294967294, 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=254, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, 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=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [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=4294967294, 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=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L192] RET updateVariables() [L193] CALL step() [L55] 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, 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=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L56] 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, 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=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] 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, 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=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) [L63] EXPR var_1_12 >> var_1_7 [L63] 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, 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=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L63] COND TRUE var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)))) [L64] 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, 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=4294967294, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=254, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L70] COND TRUE \read(var_1_1) [L71] 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, 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L73] COND FALSE !(var_1_9 >= 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, 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L86] COND TRUE var_1_27 >= (var_1_9 + 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, 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L87] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L88] var_1_36 = (var_1_27 - 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, 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L97] unsigned long int stepLocal_1 = last_1_var_1_16; [L98] 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L99] 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L100] 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] COND TRUE var_1_12 == var_1_12 [L109] 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=4294967294, var_1_19=19/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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L111] var_1_1 = (var_1_2 || (! var_1_3)) [L112] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L113] 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L114] 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L115] COND FALSE !(var_1_19 >= var_1_19) [L120] 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L125] COND TRUE var_1_19 != var_1_19 [L126] 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L134] 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L135] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L136] var_1_21 = 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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [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=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=4294967294, 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=254, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4071 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4050 mSDsluCounter, 2234 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1659 mSDsCounter, 1519 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2480 IncrementalHoareTripleChecker+Invalid, 3999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1519 mSolverCounterUnsat, 575 mSDtfsCounter, 2480 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 1233 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10093 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=5, InterpolantAutomatonStates: 182, 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, 589 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 7812 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1140 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 12639/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-20 21:23:41,922 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...