./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dd0cf58ac15bce5a25a9072051bbaed9e432a210228fe429c0a5ef55afd12b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:29:46,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:29:46,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:29:46,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:29:46,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:29:46,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:29:46,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:29:46,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:29:46,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:29:46,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:29:46,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:29:46,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:29:46,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:29:46,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:29:46,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:29:46,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:29:46,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:29:46,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:29:46,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:29:46,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:29:46,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:29:46,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:29:46,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:29:46,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:29:46,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:29:46,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:29:46,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:29:46,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:29:46,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:29:46,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:29:46,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:29:46,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:29:46,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:46,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:29:46,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:29:46,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:29:46,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:29:46,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:29:46,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:29:46,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:29:46,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:29:46,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:29:46,540 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dd0cf58ac15bce5a25a9072051bbaed9e432a210228fe429c0a5ef55afd12b4 [2024-11-09 00:29:46,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:29:46,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:29:46,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:29:46,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:29:46,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:29:46,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2024-11-09 00:29:48,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:29:48,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:29:48,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2024-11-09 00:29:48,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48cd5915/62d6032fcaf649e4a5c057598ec71b7c/FLAGa68069072 [2024-11-09 00:29:48,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a48cd5915/62d6032fcaf649e4a5c057598ec71b7c [2024-11-09 00:29:48,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:29:48,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:29:48,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:48,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:29:48,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:29:48,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:48" (1/1) ... [2024-11-09 00:29:48,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf31391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:48, skipping insertion in model container [2024-11-09 00:29:48,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:48" (1/1) ... [2024-11-09 00:29:48,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:29:48,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i[916,929] [2024-11-09 00:29:49,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:49,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:29:49,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i[916,929] [2024-11-09 00:29:49,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:49,226 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:29:49,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49 WrapperNode [2024-11-09 00:29:49,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:49,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:49,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:29:49,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:29:49,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,309 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 291 [2024-11-09 00:29:49,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:49,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:29:49,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:29:49,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:29:49,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,353 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]. [2024-11-09 00:29:49,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:29:49,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:29:49,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:29:49,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:29:49,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (1/1) ... [2024-11-09 00:29:49,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:49,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:49,434 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) [2024-11-09 00:29:49,441 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 [2024-11-09 00:29:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:29:49,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:29:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:29:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:29:49,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:29:49,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:29:49,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:29:49,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:29:50,139 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 00:29:50,139 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:29:50,153 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:29:50,153 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:29:50,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:50 BoogieIcfgContainer [2024-11-09 00:29:50,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:29:50,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:29:50,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:29:50,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:29:50,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:29:48" (1/3) ... [2024-11-09 00:29:50,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d4cf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:29:50, skipping insertion in model container [2024-11-09 00:29:50,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:49" (2/3) ... [2024-11-09 00:29:50,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d4cf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:29:50, skipping insertion in model container [2024-11-09 00:29:50,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:50" (3/3) ... [2024-11-09 00:29:50,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-86.i [2024-11-09 00:29:50,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:29:50,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:29:50,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:29:50,265 INFO L333 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, 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;@198eda5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:29:50,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:29:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:29:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 00:29:50,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:50,294 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:29:50,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 222434601, now seen corresponding path program 1 times [2024-11-09 00:29:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718268908] [2024-11-09 00:29:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:29:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:29:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:29:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:29:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:29:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:29:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:29:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:29:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:29:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:29:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:29:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:29:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:29:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:29:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:29:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:29:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:29:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:29:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:29:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:29:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:29:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:29:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:29:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:29:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718268908] [2024-11-09 00:29:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718268908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:29:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759852595] [2024-11-09 00:29:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:29:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:50,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:29:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:29:51,000 INFO L87 Difference]: Start difference. First operand has 123 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:29:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:51,041 INFO L93 Difference]: Finished difference Result 239 states and 393 transitions. [2024-11-09 00:29:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:29:51,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 181 [2024-11-09 00:29:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:51,055 INFO L225 Difference]: With dead ends: 239 [2024-11-09 00:29:51,055 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 00:29:51,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:29:51,061 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:51,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:29:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 00:29:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 00:29:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:29:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-11-09 00:29:51,121 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 181 [2024-11-09 00:29:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:51,122 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-09 00:29:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:29:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-11-09 00:29:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 00:29:51,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:51,128 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:29:51,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:29:51,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1374918751, now seen corresponding path program 1 times [2024-11-09 00:29:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353814162] [2024-11-09 00:29:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:29:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:29:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:29:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:29:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:29:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:29:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:29:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:29:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:29:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:29:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:29:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:29:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:29:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:29:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:29:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:29:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:29:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:29:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:29:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:29:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:29:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:29:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:29:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:29:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353814162] [2024-11-09 00:29:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353814162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:29:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271560620] [2024-11-09 00:29:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:52,275 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) [2024-11-09 00:29:52,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:29:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:52,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:29:52,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:29:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-09 00:29:52,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:29:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:29:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271560620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:29:53,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:29:53,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 00:29:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147887229] [2024-11-09 00:29:53,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:29:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:29:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:29:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:29:53,268 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-09 00:29:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:54,207 INFO L93 Difference]: Finished difference Result 531 states and 789 transitions. [2024-11-09 00:29:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 00:29:54,208 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), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 181 [2024-11-09 00:29:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:54,213 INFO L225 Difference]: With dead ends: 531 [2024-11-09 00:29:54,214 INFO L226 Difference]: Without dead ends: 415 [2024-11-09 00:29:54,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2024-11-09 00:29:54,217 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 968 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:54,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1667 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:29:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-09 00:29:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 282. [2024-11-09 00:29:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 248 states have internal predecessors, (369), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 00:29:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 431 transitions. [2024-11-09 00:29:54,269 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 431 transitions. Word has length 181 [2024-11-09 00:29:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:54,274 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 431 transitions. [2024-11-09 00:29:54,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-09 00:29:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 431 transitions. [2024-11-09 00:29:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:29:54,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:54,282 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:29:54,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:29:54,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:54,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1816041110, now seen corresponding path program 1 times [2024-11-09 00:29:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790338739] [2024-11-09 00:29:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:29:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:29:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:29:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:29:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:29:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:29:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:29:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:29:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:29:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:29:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:29:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:29:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:29:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:29:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:29:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:29:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:29:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:29:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:29:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:29:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:29:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 00:29:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:29:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 132 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-09 00:29:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790338739] [2024-11-09 00:29:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790338739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:29:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906110649] [2024-11-09 00:29:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:56,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:56,700 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) [2024-11-09 00:29:56,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:29:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:56,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:29:56,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:29:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 671 proven. 93 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-09 00:29:58,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:30:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906110649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:30:00,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:30:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2024-11-09 00:30:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333891518] [2024-11-09 00:30:00,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:30:00,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 00:30:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:30:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 00:30:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 00:30:00,022 INFO L87 Difference]: Start difference. First operand 282 states and 431 transitions. Second operand has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 8 states have call predecessors, (50), 9 states have call successors, (50) [2024-11-09 00:30:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:09,781 INFO L93 Difference]: Finished difference Result 2401 states and 3497 transitions. [2024-11-09 00:30:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-09 00:30:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 8 states have call predecessors, (50), 9 states have call successors, (50) Word has length 182 [2024-11-09 00:30:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:09,796 INFO L225 Difference]: With dead ends: 2401 [2024-11-09 00:30:09,796 INFO L226 Difference]: Without dead ends: 2118 [2024-11-09 00:30:09,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4697 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2515, Invalid=13741, Unknown=0, NotChecked=0, Total=16256 [2024-11-09 00:30:09,808 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 4415 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 4254 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 4254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:09,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 3492 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 4254 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 00:30:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2024-11-09 00:30:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1182. [2024-11-09 00:30:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1074 states have (on average 1.4869646182495344) internal successors, (1597), 1083 states have internal predecessors, (1597), 88 states have call successors, (88), 19 states have call predecessors, (88), 19 states have return successors, (88), 79 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 00:30:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1773 transitions. [2024-11-09 00:30:09,957 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1773 transitions. Word has length 182 [2024-11-09 00:30:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1773 transitions. [2024-11-09 00:30:09,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 31 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 8 states have call predecessors, (50), 9 states have call successors, (50) [2024-11-09 00:30:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1773 transitions. [2024-11-09 00:30:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:30:09,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:09,963 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:30:09,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:30:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 00:30:10,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:10,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash -49944271, now seen corresponding path program 1 times [2024-11-09 00:30:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:30:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231712738] [2024-11-09 00:30:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:30:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:30:10,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:30:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:30:10,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:30:10,408 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:30:10,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:30:10,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:30:10,416 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:30:10,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:30:10,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:30:10 BoogieIcfgContainer [2024-11-09 00:30:10,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:30:10,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:30:10,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:30:10,585 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:30:10,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:50" (3/4) ... [2024-11-09 00:30:10,588 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:30:10,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:30:10,590 INFO L158 Benchmark]: Toolchain (without parser) took 21856.00ms. Allocated memory was 174.1MB in the beginning and 377.5MB in the end (delta: 203.4MB). Free memory was 120.5MB in the beginning and 228.9MB in the end (delta: -108.3MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,590 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 121.6MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:30:10,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.22ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.98ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 99.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,591 INFO L158 Benchmark]: Boogie Preprocessor took 77.33ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 94.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,592 INFO L158 Benchmark]: RCFGBuilder took 764.31ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 63.9MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,592 INFO L158 Benchmark]: TraceAbstraction took 20426.77ms. Allocated memory was 174.1MB in the beginning and 377.5MB in the end (delta: 203.4MB). Free memory was 63.2MB in the beginning and 229.9MB in the end (delta: -166.8MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-09 00:30:10,592 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 377.5MB. Free memory is still 228.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:30:10,594 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.24ms. Allocated memory is still 121.6MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.22ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.98ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 99.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.33ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 94.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 764.31ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 63.9MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20426.77ms. Allocated memory was 174.1MB in the beginning and 377.5MB in the end (delta: 203.4MB). Free memory was 63.2MB in the beginning and 229.9MB in the end (delta: -166.8MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 377.5MB. Free memory is still 228.9MB. There was no memory consumed. Max. memory is 16.1GB. * 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 188, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] signed char var_1_6 = 32; [L24] signed char var_1_7 = 32; [L25] signed char var_1_8 = 1; [L26] signed char var_1_9 = 32; [L27] signed char var_1_10 = 5; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = -100; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] signed short int var_1_15 = 256; [L33] float var_1_16 = 15.918; [L34] float var_1_17 = 0.6; [L35] float var_1_18 = 100000000.75; [L36] float var_1_19 = 16.5; [L37] float var_1_20 = 8.75; [L38] unsigned short int var_1_22 = 10; [L39] float var_1_23 = -0.6; [L40] float var_1_24 = 25.75; [L41] float var_1_25 = 127.75; [L42] signed short int var_1_26 = -5; [L43] unsigned char var_1_27 = 1; [L44] unsigned char var_1_28 = 1; [L45] unsigned char var_1_29 = 1; [L46] signed short int var_1_30 = -8; [L47] signed long int var_1_31 = -8; [L48] unsigned char var_1_32 = 0; [L49] float last_1_var_1_16 = 15.918; [L50] unsigned char last_1_var_1_27 = 1; [L51] signed short int last_1_var_1_30 = -8; VAL [isInitial=0, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=32, var_1_7=32, var_1_8=1, var_1_9=32] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=32, var_1_7=32, var_1_8=1, var_1_9=32] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L141] var_1_6 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L143] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L143] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L144] var_1_7 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L146] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L146] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L147] var_1_8 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_8 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L148] RET assume_abort_if_not(var_1_8 >= -63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L149] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L150] var_1_9 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_10 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_11 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_12 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L169] var_1_19 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L170] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L173] var_1_25 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L174] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L178] var_1_29 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L196] RET updateVariables() [L197] CALL step() [L55] EXPR -100000 >> var_1_8 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L55] signed long int stepLocal_0 = -100000 >> var_1_8; [L56] COND TRUE stepLocal_0 < var_1_9 [L57] var_1_15 = ((4 - var_1_11) + (-1 + last_1_var_1_30)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L65] EXPR var_1_6 >> var_1_15 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L65] signed long int stepLocal_2 = var_1_6 >> var_1_15; [L66] COND TRUE stepLocal_2 >= var_1_8 [L67] var_1_23 = (var_1_24 - var_1_25) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L69] EXPR var_1_7 << var_1_6 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND FALSE !(10u <= (var_1_7 << var_1_6)) [L76] COND FALSE !(\read(var_1_13)) [L79] var_1_22 = ((var_1_7 + 8) + var_1_9) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_31 = var_1_8 [L82] var_1_32 = 0 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L88] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_1=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND FALSE !(((8 * var_1_15) > var_1_6) || stepLocal_1) [L94] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L96] signed char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L97] EXPR var_1_10 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L97] COND TRUE stepLocal_3 < (var_1_10 >> var_1_12) [L98] var_1_26 = (var_1_9 + var_1_7) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] signed char stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L107] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] COND FALSE !((var_1_16 / 1.5) < 8.725) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND FALSE !(! (var_1_32 || (var_1_16 > var_1_23))) [L127] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] EXPR var_1_26 & var_1_11 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] signed long int stepLocal_4 = var_1_26 & var_1_11; [L130] COND TRUE var_1_10 > stepLocal_4 [L131] var_1_27 = (var_1_28 && (! (! var_1_29))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR ((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR ((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188-L189] return ((((((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14))))) && ((var_1_9 < var_1_15) ? (var_1_30 == ((signed short int) (var_1_10 - ((((var_1_9) > (var_1_11)) ? (var_1_9) : (var_1_11)))))) : (((var_1_16 / 1.5) < 8.725) ? ((var_1_20 != (((((- var_1_20)) < (var_1_16)) ? ((- var_1_20)) : (var_1_16)))) ? (var_1_30 == ((signed short int) (var_1_8 + 128))) : 1) : 1))) && (var_1_31 == ((signed long int) var_1_8))) && (var_1_32 == ((unsigned char) 0)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=1, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5401 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5383 mSDsluCounter, 5339 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4725 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5047 IncrementalHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 614 mSDtfsCounter, 5047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 831 SyntacticMatches, 2 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4819 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1182occurred in iteration=3, InterpolantAutomatonStates: 117, 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, 3 MinimizatonAttempts, 1069 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1089 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1082 ConstructedInterpolants, 0 QuantifiedInterpolants, 7779 SizeOfPredicates, 9 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 6813/7200 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 [2024-11-09 00:30:10,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dd0cf58ac15bce5a25a9072051bbaed9e432a210228fe429c0a5ef55afd12b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:30:13,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:30:13,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:30:13,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:30:13,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:30:13,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:30:13,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:30:13,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:30:13,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:30:13,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:30:13,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:30:13,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:30:13,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:30:13,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:30:13,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:30:13,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:30:13,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:30:13,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:30:13,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:30:13,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:30:13,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:30:13,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:30:13,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:30:13,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:30:13,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:30:13,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:30:13,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:30:13,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:30:13,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:30:13,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:30:13,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:30:13,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:30:13,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:30:13,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:30:13,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:30:13,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:30:13,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:30:13,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:30:13,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:30:13,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:30:13,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:30:13,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:30:13,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:30:13,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:30:13,284 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dd0cf58ac15bce5a25a9072051bbaed9e432a210228fe429c0a5ef55afd12b4 [2024-11-09 00:30:13,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:30:13,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:30:13,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:30:13,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:30:13,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:30:13,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2024-11-09 00:30:15,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:30:15,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:30:15,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2024-11-09 00:30:15,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07586f0a/ec4667ef578d429a9f1158acb370d984/FLAG1fa21a9e5 [2024-11-09 00:30:15,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07586f0a/ec4667ef578d429a9f1158acb370d984 [2024-11-09 00:30:15,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:30:15,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:30:15,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:30:15,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:30:15,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:30:15,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:30:15" (1/1) ... [2024-11-09 00:30:15,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dc9f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:15, skipping insertion in model container [2024-11-09 00:30:15,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:30:15" (1/1) ... [2024-11-09 00:30:15,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:30:15,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i[916,929] [2024-11-09 00:30:16,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:30:16,082 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:30:16,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i[916,929] [2024-11-09 00:30:16,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:30:16,190 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:30:16,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16 WrapperNode [2024-11-09 00:30:16,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:30:16,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:30:16,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:30:16,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:30:16,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,260 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-09 00:30:16,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:30:16,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:30:16,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:30:16,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:30:16,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,346 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]. [2024-11-09 00:30:16,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:30:16,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:30:16,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:30:16,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:30:16,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (1/1) ... [2024-11-09 00:30:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:30:16,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:30:16,441 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) [2024-11-09 00:30:16,448 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 [2024-11-09 00:30:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:30:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:30:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:30:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:30:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:30:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:30:16,596 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:30:16,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:30:29,123 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 00:30:29,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:30:29,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:30:29,139 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:30:29,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:29 BoogieIcfgContainer [2024-11-09 00:30:29,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:30:29,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:30:29,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:30:29,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:30:29,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:30:15" (1/3) ... [2024-11-09 00:30:29,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449ae693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:29, skipping insertion in model container [2024-11-09 00:30:29,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:30:16" (2/3) ... [2024-11-09 00:30:29,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449ae693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:29, skipping insertion in model container [2024-11-09 00:30:29,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:29" (3/3) ... [2024-11-09 00:30:29,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-86.i [2024-11-09 00:30:29,163 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:30:29,163 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:30:29,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:30:29,237 INFO L333 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, 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;@3aadfe94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:30:29,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:30:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:30:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:30:29,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:29,257 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:30:29,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1288294001, now seen corresponding path program 1 times [2024-11-09 00:30:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:30:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812908473] [2024-11-09 00:30:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:30:29,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:30:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:30:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:29,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:30:29,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-09 00:30:29,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:30:29,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:30:29,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812908473] [2024-11-09 00:30:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812908473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:30:29,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:30:29,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:30:29,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852564012] [2024-11-09 00:30:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:30:29,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:30:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:30:29,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:30:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:30:29,970 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:30:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:30,014 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2024-11-09 00:30:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:30:30,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-09 00:30:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:30,025 INFO L225 Difference]: With dead ends: 163 [2024-11-09 00:30:30,026 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 00:30:30,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:30:30,037 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:30,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:30:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 00:30:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 00:30:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:30:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2024-11-09 00:30:30,086 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 165 [2024-11-09 00:30:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:30,086 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2024-11-09 00:30:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:30:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2024-11-09 00:30:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:30:30,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:30,091 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:30:30,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:30:30,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:30,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -488342105, now seen corresponding path program 1 times [2024-11-09 00:30:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:30:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179115036] [2024-11-09 00:30:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:30,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:30:30,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:30:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:30:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:30,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:30:30,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:30:33,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:30:33,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:30:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179115036] [2024-11-09 00:30:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179115036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:30:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:30:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:30:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544458932] [2024-11-09 00:30:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:30:33,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:30:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:30:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:30:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:30:33,411 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:30:37,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:41,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:42,045 INFO L93 Difference]: Finished difference Result 236 states and 367 transitions. [2024-11-09 00:30:42,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:30:42,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-09 00:30:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:42,060 INFO L225 Difference]: With dead ends: 236 [2024-11-09 00:30:42,060 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 00:30:42,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:30:42,062 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 40 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:42,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-09 00:30:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 00:30:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-11-09 00:30:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 00:30:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2024-11-09 00:30:42,097 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 165 [2024-11-09 00:30:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:42,099 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2024-11-09 00:30:42,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:30:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2024-11-09 00:30:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:30:42,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:42,102 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:30:42,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:30:42,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:42,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:42,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1509410459, now seen corresponding path program 1 times [2024-11-09 00:30:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:30:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349403110] [2024-11-09 00:30:42,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:30:42,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:30:42,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:30:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:42,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 00:30:42,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 598 proven. 171 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-09 00:30:57,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:30:59,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:30:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349403110] [2024-11-09 00:30:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349403110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:30:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1188882613] [2024-11-09 00:30:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:59,821 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:30:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:30:59,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:30:59,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 00:31:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:02,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 00:31:02,088 INFO L278 TraceCheckSpWp]: Computing forward predicates...