./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-e2fb8be-m [2025-03-08 15:12:22,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:12:22,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:12:22,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:12:22,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:12:22,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:12:22,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:12:22,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:12:22,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:12:22,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:12:22,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:12:22,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:12:22,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:12:22,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:12:22,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:12:22,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:12:22,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:12:22,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:12:22,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:12:22,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:12:22,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:12:22,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:12:22,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:12:22,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:12:22,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:12:22,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:12:22,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:12:22,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-08 15:12:22,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:12:22,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:12:22,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:12:22,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:12:22,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:12:22,587 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 [2025-03-08 15:12:23,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf70a057/f4850033c5cf49f992a760ca2d834303/FLAG23ebdf8b4 [2025-03-08 15:12:23,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:12:23,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2025-03-08 15:12:23,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf70a057/f4850033c5cf49f992a760ca2d834303/FLAG23ebdf8b4 [2025-03-08 15:12:24,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cf70a057/f4850033c5cf49f992a760ca2d834303 [2025-03-08 15:12:24,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:12:24,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:12:24,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:12:24,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:12:24,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:12:24,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24, skipping insertion in model container [2025-03-08 15:12:24,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:12:24,427 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] [2025-03-08 15:12:24,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:12:24,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:12:24,521 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] [2025-03-08 15:12:24,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:12:24,584 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:12:24,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24 WrapperNode [2025-03-08 15:12:24,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:12:24,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:12:24,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:12:24,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:12:24,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,644 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 288 [2025-03-08 15:12:24,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:12:24,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:12:24,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:12:24,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:12:24,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,678 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]. [2025-03-08 15:12:24,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:12:24,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:12:24,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:12:24,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:12:24,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (1/1) ... [2025-03-08 15:12:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:12:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:12:24,725 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) [2025-03-08 15:12:24,731 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 [2025-03-08 15:12:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:12:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:12:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:12:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:12:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:12:24,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:12:24,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:12:24,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:12:25,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~bitwise24#1;havoc property_#t~short25#1;havoc property_#t~bitwise26#1;havoc property_#t~short27#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1;havoc property_#t~bitwise32#1;havoc property_#t~short33#1; [2025-03-08 15:12:25,177 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-08 15:12:25,177 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:12:25,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:12:25,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:12:25,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:25 BoogieIcfgContainer [2025-03-08 15:12:25,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:12:25,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:12:25,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:12:25,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:12:25,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:12:24" (1/3) ... [2025-03-08 15:12:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591f9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:25, skipping insertion in model container [2025-03-08 15:12:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:24" (2/3) ... [2025-03-08 15:12:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591f9292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:25, skipping insertion in model container [2025-03-08 15:12:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:25" (3/3) ... [2025-03-08 15:12:25,204 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-86.i [2025-03-08 15:12:25,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:12:25,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-86.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:12:25,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:12:25,268 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;@31098e1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:12:25,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:12:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 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) [2025-03-08 15:12:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:12:25,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:25,286 INFO L218 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] [2025-03-08 15:12:25,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 456173637, now seen corresponding path program 1 times [2025-03-08 15:12:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:12:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292924680] [2025-03-08 15:12:25,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:12:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:12:25,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:12:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 15:12:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:12:25,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292924680] [2025-03-08 15:12:25,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292924680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:12:25,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556902593] [2025-03-08 15:12:25,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:25,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:12:25,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:12:25,586 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) [2025-03-08 15:12:25,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:12:25,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:12:25,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:12:25,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:25,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:25,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:12:25,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:12:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 15:12:25,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:12:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556902593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:12:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:12:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:12:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562987625] [2025-03-08 15:12:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:12:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:12:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:12:25,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:12:25,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:12:25,807 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 15:12:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:12:25,837 INFO L93 Difference]: Finished difference Result 238 states and 390 transitions. [2025-03-08 15:12:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:12:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 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 [2025-03-08 15:12:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:12:25,844 INFO L225 Difference]: With dead ends: 238 [2025-03-08 15:12:25,844 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 15:12:25,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:12:25,849 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:12:25,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:12:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 15:12:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 15:12:25,895 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) [2025-03-08 15:12:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2025-03-08 15:12:25,899 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 181 [2025-03-08 15:12:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:12:25,900 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2025-03-08 15:12:25,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 15:12:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2025-03-08 15:12:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:12:25,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:25,904 INFO L218 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] [2025-03-08 15:12:25,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:12:26,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:12:26,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:26,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1032415712, now seen corresponding path program 1 times [2025-03-08 15:12:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:12:26,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022589668] [2025-03-08 15:12:26,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:26,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:12:26,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:12:26,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:12:26,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:26,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 15:12:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:12:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022589668] [2025-03-08 15:12:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022589668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:12:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:12:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:12:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778379102] [2025-03-08 15:12:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:12:26,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:12:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:12:26,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:12:26,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:12:26,275 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-03-08 15:12:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:12:26,383 INFO L93 Difference]: Finished difference Result 350 states and 532 transitions. [2025-03-08 15:12:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:12:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 181 [2025-03-08 15:12:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:12:26,386 INFO L225 Difference]: With dead ends: 350 [2025-03-08 15:12:26,388 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 15:12:26,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:12:26,389 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 167 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:12:26,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 472 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:12:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 15:12:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2025-03-08 15:12:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 178 states have (on average 1.3932584269662922) internal successors, (248), 178 states have internal predecessors, (248), 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) [2025-03-08 15:12:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 348 transitions. [2025-03-08 15:12:26,423 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 348 transitions. Word has length 181 [2025-03-08 15:12:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:12:26,423 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 348 transitions. [2025-03-08 15:12:26,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2025-03-08 15:12:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 348 transitions. [2025-03-08 15:12:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:12:26,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:26,426 INFO L218 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] [2025-03-08 15:12:26,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:12:26,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash 777679167, now seen corresponding path program 1 times [2025-03-08 15:12:26,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:12:26,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652475040] [2025-03-08 15:12:26,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:12:26,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:12:26,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:12:26,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:26,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 15:12:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:12:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652475040] [2025-03-08 15:12:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652475040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:12:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239945852] [2025-03-08 15:12:27,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:12:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:12:27,094 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) [2025-03-08 15:12:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:12:27,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:12:27,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:12:27,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:27,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:27,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:12:27,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:12:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-08 15:12:27,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:12:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 15:12:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239945852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:12:27,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:12:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 15:12:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576282047] [2025-03-08 15:12:27,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:12:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:12:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:12:27,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:12:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:12:27,761 INFO L87 Difference]: Start difference. First operand 231 states and 348 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) [2025-03-08 15:12:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:12:28,448 INFO L93 Difference]: Finished difference Result 1033 states and 1524 transitions. [2025-03-08 15:12:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 15:12:28,449 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 [2025-03-08 15:12:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:12:28,457 INFO L225 Difference]: With dead ends: 1033 [2025-03-08 15:12:28,457 INFO L226 Difference]: Without dead ends: 805 [2025-03-08 15:12:28,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:12:28,459 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 794 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:12:28,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1380 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:12:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-08 15:12:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 551. [2025-03-08 15:12:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 482 states have (on average 1.4564315352697095) internal successors, (702), 484 states have internal predecessors, (702), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:12:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 826 transitions. [2025-03-08 15:12:28,509 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 826 transitions. Word has length 181 [2025-03-08 15:12:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:12:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 826 transitions. [2025-03-08 15:12:28,511 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) [2025-03-08 15:12:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 826 transitions. [2025-03-08 15:12:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:12:28,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:28,515 INFO L218 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] [2025-03-08 15:12:28,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:12:28,716 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 [2025-03-08 15:12:28,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 215328428, now seen corresponding path program 1 times [2025-03-08 15:12:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:12:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45271219] [2025-03-08 15:12:28,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:12:28,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:12:28,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:12:28,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:28,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-08 15:12:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:12:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45271219] [2025-03-08 15:12:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45271219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:12:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996481977] [2025-03-08 15:12:29,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:29,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:12:29,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:12:29,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:12:29,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:12:29,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:12:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:12:29,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:29,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 15:12:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:12:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 671 proven. 93 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-08 15:12:31,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:12:31,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996481977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:12:31,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:12:31,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2025-03-08 15:12:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782519547] [2025-03-08 15:12:31,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:12:31,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 15:12:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:12:31,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 15:12:31,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 15:12:31,926 INFO L87 Difference]: Start difference. First operand 551 states and 826 transitions. Second operand has 29 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 7 states have call predecessors, (50), 9 states have call successors, (50) [2025-03-08 15:12:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:12:37,137 INFO L93 Difference]: Finished difference Result 4015 states and 5841 transitions. [2025-03-08 15:12:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 15:12:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 7 states have call predecessors, (50), 9 states have call successors, (50) Word has length 182 [2025-03-08 15:12:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:12:37,151 INFO L225 Difference]: With dead ends: 4015 [2025-03-08 15:12:37,151 INFO L226 Difference]: Without dead ends: 3463 [2025-03-08 15:12:37,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1942, Invalid=8978, Unknown=0, NotChecked=0, Total=10920 [2025-03-08 15:12:37,156 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 5922 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5928 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:12:37,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5928 Valid, 2646 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 15:12:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2025-03-08 15:12:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 1649. [2025-03-08 15:12:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1506 states have (on average 1.4714475431606906) internal successors, (2216), 1512 states have internal predecessors, (2216), 120 states have call successors, (120), 22 states have call predecessors, (120), 22 states have return successors, (120), 114 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:12:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2456 transitions. [2025-03-08 15:12:37,242 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2456 transitions. Word has length 182 [2025-03-08 15:12:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:12:37,243 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2456 transitions. [2025-03-08 15:12:37,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 9 states have call successors, (50), 5 states have call predecessors, (50), 8 states have return successors, (50), 7 states have call predecessors, (50), 9 states have call successors, (50) [2025-03-08 15:12:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2456 transitions. [2025-03-08 15:12:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 15:12:37,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:37,245 INFO L218 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] [2025-03-08 15:12:37,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:12:37,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:12:37,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash 864722042, now seen corresponding path program 1 times [2025-03-08 15:12:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:12:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724291365] [2025-03-08 15:12:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:12:37,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:12:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:12:37,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:12:37,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:12:37,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 15:12:37,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 15:12:37,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:37,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:12:37,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:12:37,634 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:12:37,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:12:37,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:12:37,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 15:12:37,736 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:12:37,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:12:37 BoogieIcfgContainer [2025-03-08 15:12:37,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:12:37,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:12:37,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:12:37,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:12:37,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:25" (3/4) ... [2025-03-08 15:12:37,741 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:12:37,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:12:37,743 INFO L158 Benchmark]: Toolchain (without parser) took 13451.86ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 159.6MB in the beginning and 230.3MB in the end (delta: -70.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-08 15:12:37,743 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:12:37,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.11ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 143.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:12:37,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 140.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:12:37,743 INFO L158 Benchmark]: Boogie Preprocessor took 45.96ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 137.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:12:37,743 INFO L158 Benchmark]: IcfgBuilder took 500.90ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 106.2MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:12:37,744 INFO L158 Benchmark]: TraceAbstraction took 12540.65ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 105.5MB in the beginning and 230.4MB in the end (delta: -124.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:12:37,744 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 318.8MB. Free memory was 230.4MB in the beginning and 230.3MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:12:37,745 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.32ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.11ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 143.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 140.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.96ms. Allocated memory is still 201.3MB. Free memory was 140.8MB in the beginning and 137.0MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 500.90ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 106.2MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12540.65ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 105.5MB in the beginning and 230.4MB in the end (delta: -124.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 318.8MB. Free memory was 230.4MB in the beginning and 230.3MB in the end (delta: 63.1kB). 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 174, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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=63, 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, 122 locations, 210 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 5, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6901 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6883 mSDsluCounter, 4668 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3825 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4073 IncrementalHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 843 mSDtfsCounter, 4073 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 838 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3163 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1649occurred in iteration=4, InterpolantAutomatonStates: 100, 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, 4 MinimizatonAttempts, 2071 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1442 ConstructedInterpolants, 0 QuantifiedInterpolants, 7404 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1262 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 9204/9600 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:12:37,764 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/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-e2fb8be-m [2025-03-08 15:12:39,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:12:39,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:12:39,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:12:39,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:12:39,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:12:39,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:12:39,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:12:39,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:12:39,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:12:39,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:12:39,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:12:39,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:12:39,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:12:39,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:12:39,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:12:39,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:12:39,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:12:39,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:12:39,730 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:12:39,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:12:39,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:12:39,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:12:39,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:12:39,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-08 15:12:39,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:12:39,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:12:39,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:12:39,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:12:39,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:12:39,969 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 [2025-03-08 15:12:41,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2543a5bd5/36cd8568ce4b4fe1b93e786f4e21b989/FLAG963ce4e3b [2025-03-08 15:12:41,350 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:12:41,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-86.i [2025-03-08 15:12:41,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2543a5bd5/36cd8568ce4b4fe1b93e786f4e21b989/FLAG963ce4e3b [2025-03-08 15:12:41,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2543a5bd5/36cd8568ce4b4fe1b93e786f4e21b989 [2025-03-08 15:12:41,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:12:41,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:12:41,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:12:41,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:12:41,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:12:41,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7598d2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41, skipping insertion in model container [2025-03-08 15:12:41,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:12:41,509 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] [2025-03-08 15:12:41,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:12:41,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:12:41,594 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] [2025-03-08 15:12:41,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:12:41,640 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:12:41,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41 WrapperNode [2025-03-08 15:12:41,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:12:41,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:12:41,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:12:41,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:12:41,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,688 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2025-03-08 15:12:41,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:12:41,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:12:41,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:12:41,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:12:41,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,720 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]. [2025-03-08 15:12:41,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:12:41,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:12:41,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:12:41,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:12:41,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (1/1) ... [2025-03-08 15:12:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:12:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:12:41,764 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) [2025-03-08 15:12:41,768 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 [2025-03-08 15:12:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:12:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:12:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:12:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:12:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:12:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:12:41,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:12:41,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:12:51,312 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 15:12:51,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:12:51,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:12:51,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:12:51,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:51 BoogieIcfgContainer [2025-03-08 15:12:51,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:12:51,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:12:51,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:12:51,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:12:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:12:41" (1/3) ... [2025-03-08 15:12:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:51, skipping insertion in model container [2025-03-08 15:12:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:41" (2/3) ... [2025-03-08 15:12:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cec78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:51, skipping insertion in model container [2025-03-08 15:12:51,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:51" (3/3) ... [2025-03-08 15:12:51,328 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-86.i [2025-03-08 15:12:51,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:12:51,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-86.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:12:51,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:12:51,387 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;@19d51346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:12:51,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:12:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 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) [2025-03-08 15:12:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 15:12:51,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:51,398 INFO L218 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] [2025-03-08 15:12:51,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -46298496, now seen corresponding path program 1 times [2025-03-08 15:12:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:12:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748330810] [2025-03-08 15:12:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:51,410 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 [2025-03-08 15:12:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:12:51,413 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) [2025-03-08 15:12:51,423 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 [2025-03-08 15:12:51,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 15:12:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 15:12:51,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:51,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:51,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:12:51,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:12:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 15:12:51,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:12:51,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:12:51,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748330810] [2025-03-08 15:12:51,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748330810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:12:51,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:12:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:12:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204597623] [2025-03-08 15:12:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:12:51,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:12:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:12:51,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:12:51,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:12:51,884 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 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) [2025-03-08 15:12:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:12:51,911 INFO L93 Difference]: Finished difference Result 162 states and 280 transitions. [2025-03-08 15:12:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:12:51,912 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 [2025-03-08 15:12:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:12:51,917 INFO L225 Difference]: With dead ends: 162 [2025-03-08 15:12:51,918 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 15:12:51,921 INFO L434 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 [2025-03-08 15:12:51,924 INFO L435 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 [2025-03-08 15:12:51,926 INFO L436 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] [2025-03-08 15:12:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 15:12:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 15:12:51,958 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) [2025-03-08 15:12:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2025-03-08 15:12:51,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 165 [2025-03-08 15:12:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:12:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2025-03-08 15:12:51,967 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) [2025-03-08 15:12:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2025-03-08 15:12:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 15:12:51,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:12:51,971 INFO L218 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] [2025-03-08 15:12:51,986 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 [2025-03-08 15:12:52,171 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 [2025-03-08 15:12:52,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:12:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:12:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1212867099, now seen corresponding path program 1 times [2025-03-08 15:12:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:12:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353561850] [2025-03-08 15:12:52,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:12:52,174 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 [2025-03-08 15:12:52,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:12:52,178 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) [2025-03-08 15:12:52,179 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 [2025-03-08 15:12:52,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 15:12:52,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 15:12:52,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:12:52,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:12:52,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:12:52,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:12:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 15:12:54,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:12:54,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:12:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353561850] [2025-03-08 15:12:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353561850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:12:54,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:12:54,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:12:54,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649957097] [2025-03-08 15:12:54,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:12:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:12:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:12:54,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:12:54,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:12:54,428 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) [2025-03-08 15:12:58,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:13:02,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:13:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:13:02,916 INFO L93 Difference]: Finished difference Result 236 states and 367 transitions. [2025-03-08 15:13:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:13:02,916 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 [2025-03-08 15:13:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:13:02,919 INFO L225 Difference]: With dead ends: 236 [2025-03-08 15:13:02,920 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 15:13:02,920 INFO L434 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 [2025-03-08 15:13:02,921 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 40 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:13:02,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 15:13:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 15:13:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-03-08 15:13:02,939 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) [2025-03-08 15:13:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2025-03-08 15:13:02,940 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 165 [2025-03-08 15:13:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:13:02,941 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2025-03-08 15:13:02,941 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) [2025-03-08 15:13:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2025-03-08 15:13:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 15:13:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:13:02,943 INFO L218 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] [2025-03-08 15:13:02,956 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 [2025-03-08 15:13:03,143 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 [2025-03-08 15:13:03,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:13:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:13:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 702332922, now seen corresponding path program 1 times [2025-03-08 15:13:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:13:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496608234] [2025-03-08 15:13:03,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:13:03,145 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 [2025-03-08 15:13:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:13:03,147 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) [2025-03-08 15:13:03,148 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 [2025-03-08 15:13:03,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 15:13:03,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 15:13:03,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:13:03,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:13:03,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:13:03,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:13:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 598 proven. 171 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-03-08 15:13:14,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:13:16,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:13:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496608234] [2025-03-08 15:13:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496608234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:13:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1386987267] [2025-03-08 15:13:16,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:13:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 15:13:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 15:13:16,196 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) [2025-03-08 15:13:16,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 15:13:16,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 15:13:18,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 15:13:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:13:18,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:13:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 15:13:18,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:13:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 512 proven. 303 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-08 15:13:38,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:13:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1386987267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:13:43,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:13:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 40 [2025-03-08 15:13:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470120375] [2025-03-08 15:13:43,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:13:43,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 15:13:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:13:43,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 15:13:43,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2537, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:13:43,203 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand has 41 states, 41 states have (on average 2.7560975609756095) internal successors, (113), 38 states have internal predecessors, (113), 11 states have call successors, (49), 11 states have call predecessors, (49), 15 states have return successors, (50), 11 states have call predecessors, (50), 11 states have call successors, (50)