./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:30:14,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:30:14,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:30:14,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:30:14,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:30:14,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:30:14,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:30:14,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:30:14,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:30:14,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:30:14,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:30:14,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:30:14,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:30:14,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:30:14,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:30:14,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:30:14,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:30:14,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:14,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:14,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:30:14,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:30:14,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:30:14,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:30:14,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:30:14,765 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-jdk21/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 -> 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf [2025-01-09 11:30:14,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:30:14,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:30:14,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:30:14,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:30:14,988 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:30:14,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:16,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe204e06/0994a713e4664f84b9152f1ca9254477/FLAGb3e3530fb [2025-01-09 11:30:16,362 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:30:16,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:16,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe204e06/0994a713e4664f84b9152f1ca9254477/FLAGb3e3530fb [2025-01-09 11:30:16,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe204e06/0994a713e4664f84b9152f1ca9254477 [2025-01-09 11:30:16,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:30:16,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:30:16,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:30:16,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:30:16,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:30:16,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411f8229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16, skipping insertion in model container [2025-01-09 11:30:16,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:30:16,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-01-09 11:30:16,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:30:16,873 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:30:16,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-01-09 11:30:16,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:30:16,911 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:30:16,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16 WrapperNode [2025-01-09 11:30:16,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:30:16,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:30:16,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:30:16,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:30:16,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,958 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-01-09 11:30:16,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:30:16,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:30:16,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:30:16,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:30:16,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,978 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-01-09 11:30:16,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:16,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:17,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:17,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:30:17,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:30:17,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:30:17,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:30:17,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (1/1) ... [2025-01-09 11:30:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:30:17,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:30:17,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:30:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:30:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:30:17,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:30:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:30:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:30:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:30:17,130 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:30:17,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:30:17,497 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 11:30:17,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:30:17,508 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:30:17,508 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:30:17,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:30:17 BoogieIcfgContainer [2025-01-09 11:30:17,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:30:17,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:30:17,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:30:17,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:30:17,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:30:16" (1/3) ... [2025-01-09 11:30:17,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718231c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:30:17, skipping insertion in model container [2025-01-09 11:30:17,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:16" (2/3) ... [2025-01-09 11:30:17,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718231c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:30:17, skipping insertion in model container [2025-01-09 11:30:17,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:30:17" (3/3) ... [2025-01-09 11:30:17,517 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:17,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:30:17,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:30:17,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:30:17,581 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;@260df2c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:30:17,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:30:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:30:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 11:30:17,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:17,595 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:17,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -63460584, now seen corresponding path program 1 times [2025-01-09 11:30:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553956536] [2025-01-09 11:30:17,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:17,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 11:30:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 11:30:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:17,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553956536] [2025-01-09 11:30:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553956536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:17,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:30:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593470276] [2025-01-09 11:30:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:30:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:17,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:30:17,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:30:17,932 INFO L87 Difference]: Start difference. First operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:17,951 INFO L93 Difference]: Finished difference Result 214 states and 370 transitions. [2025-01-09 11:30:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:30:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 11:30:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:17,958 INFO L225 Difference]: With dead ends: 214 [2025-01-09 11:30:17,958 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 11:30:17,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-09 11:30:17,962 INFO L435 NwaCegarLoop]: 166 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, 166 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-01-09 11:30:17,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:30:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 11:30:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 11:30:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:30:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2025-01-09 11:30:17,991 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 204 [2025-01-09 11:30:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2025-01-09 11:30:17,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2025-01-09 11:30:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 11:30:17,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:17,995 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:17,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 11:30:17,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:17,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1549752962, now seen corresponding path program 1 times [2025-01-09 11:30:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334412007] [2025-01-09 11:30:17,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:18,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 11:30:18,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 11:30:18,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:18,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334412007] [2025-01-09 11:30:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334412007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:30:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288692065] [2025-01-09 11:30:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:18,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:30:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:18,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:30:18,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:30:18,159 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:18,227 INFO L93 Difference]: Finished difference Result 304 states and 473 transitions. [2025-01-09 11:30:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:30:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 11:30:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:18,232 INFO L225 Difference]: With dead ends: 304 [2025-01-09 11:30:18,232 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 11:30:18,233 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-01-09 11:30:18,233 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 147 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 290 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:30:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 11:30:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-01-09 11:30:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 133 states have internal predecessors, (180), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 11:30:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2025-01-09 11:30:18,286 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 205 [2025-01-09 11:30:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2025-01-09 11:30:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2025-01-09 11:30:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:30:18,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:18,290 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:18,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:30:18,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2059033078, now seen corresponding path program 1 times [2025-01-09 11:30:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925290354] [2025-01-09 11:30:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:30:18,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:30:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925290354] [2025-01-09 11:30:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925290354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:18,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:18,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:30:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068055114] [2025-01-09 11:30:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:30:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:18,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:30:18,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:30:18,469 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:18,611 INFO L93 Difference]: Finished difference Result 514 states and 791 transitions. [2025-01-09 11:30:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:30:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 11:30:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:18,618 INFO L225 Difference]: With dead ends: 514 [2025-01-09 11:30:18,618 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 11:30:18,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 11:30:18,620 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 155 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:18,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 430 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:30:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 11:30:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 201. [2025-01-09 11:30:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 11:30:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2025-01-09 11:30:18,645 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 207 [2025-01-09 11:30:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:18,645 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2025-01-09 11:30:18,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2025-01-09 11:30:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:30:18,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:18,647 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:30:18,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:18,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1649128204, now seen corresponding path program 1 times [2025-01-09 11:30:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355928180] [2025-01-09 11:30:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:18,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:30:18,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:30:18,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:18,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355928180] [2025-01-09 11:30:18,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355928180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:18,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:18,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:30:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388055903] [2025-01-09 11:30:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:18,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:30:18,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:18,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:30:18,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:30:18,922 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:19,146 INFO L93 Difference]: Finished difference Result 677 states and 1037 transitions. [2025-01-09 11:30:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:30:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 11:30:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:19,151 INFO L225 Difference]: With dead ends: 677 [2025-01-09 11:30:19,152 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 11:30:19,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:30:19,154 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 178 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:19,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 502 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:30:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 11:30:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 461. [2025-01-09 11:30:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 332 states have (on average 1.3855421686746987) internal successors, (460), 332 states have internal predecessors, (460), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 11:30:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 708 transitions. [2025-01-09 11:30:19,204 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 708 transitions. Word has length 207 [2025-01-09 11:30:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:19,205 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 708 transitions. [2025-01-09 11:30:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 708 transitions. [2025-01-09 11:30:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 11:30:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:19,207 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:30:19,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1718649716, now seen corresponding path program 1 times [2025-01-09 11:30:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209415118] [2025-01-09 11:30:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:19,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 11:30:19,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 11:30:19,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:19,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209415118] [2025-01-09 11:30:19,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209415118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:19,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:30:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142537573] [2025-01-09 11:30:19,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:19,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:30:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:30:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:30:19,583 INFO L87 Difference]: Start difference. First operand 461 states and 708 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:20,596 INFO L93 Difference]: Finished difference Result 1475 states and 2217 transitions. [2025-01-09 11:30:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:30:20,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 11:30:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:20,601 INFO L225 Difference]: With dead ends: 1475 [2025-01-09 11:30:20,601 INFO L226 Difference]: Without dead ends: 1017 [2025-01-09 11:30:20,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:30:20,603 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 470 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:20,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1201 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:30:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-09 11:30:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 477. [2025-01-09 11:30:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 344 states have (on average 1.372093023255814) internal successors, (472), 344 states have internal predecessors, (472), 124 states have call successors, (124), 8 states have call predecessors, (124), 8 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 11:30:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 720 transitions. [2025-01-09 11:30:20,657 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 720 transitions. Word has length 208 [2025-01-09 11:30:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 720 transitions. [2025-01-09 11:30:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 720 transitions. [2025-01-09 11:30:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 11:30:20,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:20,659 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:20,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:30:20,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:20,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1460484278, now seen corresponding path program 1 times [2025-01-09 11:30:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235280903] [2025-01-09 11:30:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:20,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:20,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 11:30:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 11:30:20,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:20,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:30:21,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235280903] [2025-01-09 11:30:21,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235280903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:30:21,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722634368] [2025-01-09 11:30:21,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:21,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:30:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:30:21,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:30:21,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:30:21,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 11:30:21,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 11:30:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:21,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 11:30:21,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 11:30:21,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:30:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:30:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722634368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:30:22,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:30:22,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2025-01-09 11:30:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649797429] [2025-01-09 11:30:22,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:30:22,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 11:30:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:22,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 11:30:22,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:30:22,104 INFO L87 Difference]: Start difference. First operand 477 states and 720 transitions. Second operand has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-01-09 11:30:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:24,270 INFO L93 Difference]: Finished difference Result 1420 states and 2089 transitions. [2025-01-09 11:30:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 11:30:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 208 [2025-01-09 11:30:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:24,276 INFO L225 Difference]: With dead ends: 1420 [2025-01-09 11:30:24,276 INFO L226 Difference]: Without dead ends: 946 [2025-01-09 11:30:24,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 11:30:24,281 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1300 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:24,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 2495 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:30:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-01-09 11:30:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 484. [2025-01-09 11:30:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 347 states have (on average 1.3515850144092219) internal successors, (469), 347 states have internal predecessors, (469), 124 states have call successors, (124), 12 states have call predecessors, (124), 12 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 11:30:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 717 transitions. [2025-01-09 11:30:24,337 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 717 transitions. Word has length 208 [2025-01-09 11:30:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:24,338 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 717 transitions. [2025-01-09 11:30:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-01-09 11:30:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 717 transitions. [2025-01-09 11:30:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 11:30:24,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:24,340 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:24,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:30:24,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:30:24,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:24,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1597883658, now seen corresponding path program 1 times [2025-01-09 11:30:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996729151] [2025-01-09 11:30:24,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:24,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 11:30:24,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 11:30:24,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:24,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:30:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996729151] [2025-01-09 11:30:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996729151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:30:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792030534] [2025-01-09 11:30:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:30:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:30:24,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:30:24,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:30:24,872 INFO L87 Difference]: Start difference. First operand 484 states and 717 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:30:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:26,024 INFO L93 Difference]: Finished difference Result 2144 states and 3148 transitions. [2025-01-09 11:30:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 11:30:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 209 [2025-01-09 11:30:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:26,036 INFO L225 Difference]: With dead ends: 2144 [2025-01-09 11:30:26,036 INFO L226 Difference]: Without dead ends: 1663 [2025-01-09 11:30:26,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:30:26,040 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 834 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:26,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1174 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:30:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-01-09 11:30:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 913. [2025-01-09 11:30:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 640 states have (on average 1.3234375) internal successors, (847), 640 states have internal predecessors, (847), 248 states have call successors, (248), 24 states have call predecessors, (248), 24 states have return successors, (248), 248 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 11:30:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1343 transitions. [2025-01-09 11:30:26,133 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1343 transitions. Word has length 209 [2025-01-09 11:30:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:26,133 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1343 transitions. [2025-01-09 11:30:26,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:30:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1343 transitions. [2025-01-09 11:30:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 11:30:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:26,137 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:26,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:30:26,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1990910668, now seen corresponding path program 1 times [2025-01-09 11:30:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:30:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564412433] [2025-01-09 11:30:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:30:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 11:30:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 11:30:26,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:30:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174119721] [2025-01-09 11:30:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:30:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:30:26,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:30:26,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:30:26,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 11:30:26,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 11:30:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:30:26,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:30:26,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 11:30:26,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 11:30:26,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:26,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:30:27,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:30:27,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:30:27,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:30:27,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:30:27,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:30:27,275 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:30:27,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:30:27,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:30:27 BoogieIcfgContainer [2025-01-09 11:30:27,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:30:27,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:30:27,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:30:27,396 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:30:27,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:30:17" (3/4) ... [2025-01-09 11:30:27,398 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:30:27,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:30:27,400 INFO L158 Benchmark]: Toolchain (without parser) took 10706.15ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.6MB in the beginning and 240.3MB in the end (delta: -133.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-01-09 11:30:27,400 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.01ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 90.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.33ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 81.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: RCFGBuilder took 503.39ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 50.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: TraceAbstraction took 9884.75ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.1MB in the beginning and 240.4MB in the end (delta: -190.3MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2025-01-09 11:30:27,401 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 240.4MB in the beginning and 240.3MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:30:27,402 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.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.01ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 90.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.33ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 81.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 503.39ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 50.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9884.75ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.1MB in the beginning and 240.4MB in the end (delta: -190.3MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 240.4MB in the beginning and 240.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 shiftLeft at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryArithmeticFLOAToperation at line 132, overapproximation of someBinaryArithmeticFLOAToperation at line 77, overapproximation of someUnaryFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_32 = 64; [L42] unsigned char var_1_33 = 1; [L43] unsigned char var_1_34 = 0; [L44] float var_1_35 = 32.4; [L45] float var_1_36 = 8.5; [L46] float var_1_37 = 7.5; [L47] float var_1_38 = 3.2; [L48] unsigned char var_1_39 = 16; [L49] unsigned char var_1_40 = 5; [L50] signed short int var_1_41 = -2; [L51] unsigned char var_1_42 = 10; [L52] unsigned char var_1_43 = 4; [L53] unsigned char var_1_44 = 64; [L54] signed long int var_1_45 = -25; [L55] unsigned char last_1_var_1_1 = 0; [L56] unsigned long int last_1_var_1_9 = 10; [L57] signed short int last_1_var_1_14 = 32; [L58] unsigned char last_1_var_1_16 = 1; [L59] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L207] isInitial = 1 [L208] FCALL initially() [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_11 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_12 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] var_1_13 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_15 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] var_1_19 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_32 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_32 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_32 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] var_1_34 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_34 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_34 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] CALL assume_abort_if_not(var_1_34 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] RET assume_abort_if_not(var_1_34 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L179] var_1_36 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L181] var_1_37 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L183] var_1_38 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L184] RET assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L185] var_1_40 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L186] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L191] var_1_44 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L192] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L211] RET updateVariables() [L212] CALL step() [L63] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L64] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L65] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L70] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=1, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L72] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L74] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L75] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L76] COND TRUE (! var_1_1) || stepLocal_4 [L77] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L85] COND FALSE !(\read(var_1_1)) [L92] var_1_24 = var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L94] var_1_20 = var_1_21 [L95] var_1_22 = var_1_12 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L96] COND TRUE var_1_23 >= var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=8, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L97] COND TRUE (4 % var_1_32) > var_1_20 [L98] var_1_31 = ((((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256) < 0 ) ? -(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256) : (((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) + 256))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L103] COND TRUE \read(var_1_34) [L104] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L108] var_1_23 = var_1_21 [L109] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L110] COND FALSE !(var_1_1 || var_1_1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L113] COND TRUE (var_1_14 / var_1_32) >= var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L114] COND TRUE \read(var_1_34) [L115] var_1_45 = (((((var_1_14) < (var_1_43)) ? (var_1_14) : (var_1_43))) - var_1_44) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L122] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L125] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L125] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L126] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L131] COND TRUE var_1_23 >= var_1_16 [L132] var_1_35 = ((var_1_36 - var_1_37) + var_1_38) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L134] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L135] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L136] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L137] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L141] COND TRUE var_1_22 <= ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) [L142] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L203] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L203-L204] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=0, var_1_17=11, var_1_18=-256, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=100, var_1_31=289, var_1_32=33, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3116 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3084 mSDsluCounter, 6258 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4389 mSDsCounter, 1611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3516 IncrementalHoareTripleChecker+Invalid, 5127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1611 mSolverCounterUnsat, 1869 mSDtfsCounter, 3516 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=913occurred in iteration=7, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 1890 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2074 NumberOfCodeBlocks, 2074 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1855 ConstructedInterpolants, 0 QuantifiedInterpolants, 3859 SizeOfPredicates, 5 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 16605/16740 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-01-09 11:30:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:30:29,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:30:29,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:30:29,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:30:29,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:30:29,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:30:29,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:30:29,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:30:29,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:30:29,433 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:30:29,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:30:29,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:30:29,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:30:29,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:30:29,434 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:30:29,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:30:29,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:30:29,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:30:29,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:30:29,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:29,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:30:29,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:29,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:30:29,437 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:30:29,438 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:30:29,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:30:29,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:30:29,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:30:29,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:30:29,438 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-jdk21/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 -> 18a28dd9fabec49f402c0f8b2e2f11d6a9036437fc512405ace7df9d63b865bf [2025-01-09 11:30:29,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:30:29,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:30:29,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:30:29,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:30:29,693 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:30:29,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:30,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d788aaa9d/2447e60476594b7aa23e9684d3e1711a/FLAG365509f92 [2025-01-09 11:30:31,120 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:30:31,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:31,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d788aaa9d/2447e60476594b7aa23e9684d3e1711a/FLAG365509f92 [2025-01-09 11:30:31,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d788aaa9d/2447e60476594b7aa23e9684d3e1711a [2025-01-09 11:30:31,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:30:31,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:30:31,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:30:31,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:30:31,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:30:31,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207c4d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31, skipping insertion in model container [2025-01-09 11:30:31,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:30:31,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-01-09 11:30:31,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:30:31,649 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:30:31,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i[919,932] [2025-01-09 11:30:31,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:30:31,705 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:30:31,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31 WrapperNode [2025-01-09 11:30:31,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:30:31,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:30:31,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:30:31,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:30:31,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,744 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-01-09 11:30:31,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:30:31,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:30:31,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:30:31,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:30:31,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,773 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-01-09 11:30:31,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:30:31,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:30:31,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:30:31,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:30:31,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (1/1) ... [2025-01-09 11:30:31,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:30:31,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:30:31,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:30:31,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:30:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:30:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:30:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:30:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:30:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:30:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:30:31,916 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:30:31,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:30:32,928 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 11:30:32,928 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:30:32,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:30:32,936 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:30:32,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:30:32 BoogieIcfgContainer [2025-01-09 11:30:32,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:30:32,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:30:32,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:30:32,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:30:32,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:30:31" (1/3) ... [2025-01-09 11:30:32,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eb7478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:30:32, skipping insertion in model container [2025-01-09 11:30:32,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:30:31" (2/3) ... [2025-01-09 11:30:32,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eb7478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:30:32, skipping insertion in model container [2025-01-09 11:30:32,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:30:32" (3/3) ... [2025-01-09 11:30:32,947 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i [2025-01-09 11:30:32,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:30:32,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-53.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:30:33,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:30:33,016 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;@4ab67a45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:30:33,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:30:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:30:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 11:30:33,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:33,028 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:33,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:33,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1056845384, now seen corresponding path program 1 times [2025-01-09 11:30:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:30:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582712970] [2025-01-09 11:30:33,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:33,040 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-01-09 11:30:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:30:33,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 11:30:33,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:30:33,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 11:30:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 11:30:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:33,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:30:33,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2025-01-09 11:30:33,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:30:33,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:30:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582712970] [2025-01-09 11:30:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582712970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:33,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:33,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:30:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887586766] [2025-01-09 11:30:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:33,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:30:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:30:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:30:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:30:33,541 INFO L87 Difference]: Start difference. First operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:30:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:33,562 INFO L93 Difference]: Finished difference Result 178 states and 316 transitions. [2025-01-09 11:30:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:30:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-01-09 11:30:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:33,568 INFO L225 Difference]: With dead ends: 178 [2025-01-09 11:30:33,568 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 11:30:33,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-01-09 11:30:33,572 INFO L435 NwaCegarLoop]: 139 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, 139 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-01-09 11:30:33,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:30:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 11:30:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 11:30:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 11:30:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-01-09 11:30:33,604 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 199 [2025-01-09 11:30:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:33,604 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-01-09 11:30:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 11:30:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-01-09 11:30:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 11:30:33,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:33,608 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:33,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:30:33,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 11:30:33,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:33,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash 836715837, now seen corresponding path program 1 times [2025-01-09 11:30:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:30:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969716718] [2025-01-09 11:30:33,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:33,811 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-01-09 11:30:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:30:33,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 11:30:33,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:30:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 11:30:34,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 11:30:34,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:34,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:34,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:30:34,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:34,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:30:34,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:30:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969716718] [2025-01-09 11:30:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969716718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:34,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:30:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703636226] [2025-01-09 11:30:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:34,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:30:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:30:34,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:30:34,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:30:34,544 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:34,983 INFO L93 Difference]: Finished difference Result 257 states and 403 transitions. [2025-01-09 11:30:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:30:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-01-09 11:30:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:34,986 INFO L225 Difference]: With dead ends: 257 [2025-01-09 11:30:34,986 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 11:30:34,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 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-01-09 11:30:34,987 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 30 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:34,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 250 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:30:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 11:30:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-01-09 11:30:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 11:30:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 262 transitions. [2025-01-09 11:30:35,020 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 262 transitions. Word has length 200 [2025-01-09 11:30:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:35,021 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 262 transitions. [2025-01-09 11:30:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 262 transitions. [2025-01-09 11:30:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 11:30:35,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:35,027 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:35,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 11:30:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 11:30:35,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1843748260, now seen corresponding path program 1 times [2025-01-09 11:30:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:30:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083345053] [2025-01-09 11:30:35,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:35,229 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-01-09 11:30:35,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:30:35,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 11:30:35,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:30:35,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 11:30:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 11:30:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:35,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:30:35,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 904 proven. 33 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-01-09 11:30:36,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:30:37,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:30:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083345053] [2025-01-09 11:30:37,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083345053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:30:37,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [33565495] [2025-01-09 11:30:37,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:37,707 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:30:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:30:37,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:30:37,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 11:30:37,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 11:30:38,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 11:30:38,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:38,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:30:38,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:38,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:30:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [33565495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:30:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-01-09 11:30:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349320823] [2025-01-09 11:30:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:30:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:30:38,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:30:38,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:30:38,997 INFO L87 Difference]: Start difference. First operand 169 states and 262 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:40,984 INFO L93 Difference]: Finished difference Result 585 states and 891 transitions. [2025-01-09 11:30:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:30:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-01-09 11:30:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:40,988 INFO L225 Difference]: With dead ends: 585 [2025-01-09 11:30:40,988 INFO L226 Difference]: Without dead ends: 419 [2025-01-09 11:30:40,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:30:40,990 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 319 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:40,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1233 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 11:30:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-09 11:30:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 233. [2025-01-09 11:30:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 135 states have internal predecessors, (169), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:30:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 355 transitions. [2025-01-09 11:30:41,024 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 355 transitions. Word has length 201 [2025-01-09 11:30:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 355 transitions. [2025-01-09 11:30:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:30:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 355 transitions. [2025-01-09 11:30:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 11:30:41,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:41,027 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:41,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 11:30:41,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-01-09 11:30:41,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:30:41,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1641872410, now seen corresponding path program 1 times [2025-01-09 11:30:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:30:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509245704] [2025-01-09 11:30:41,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:41,429 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-01-09 11:30:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:30:41,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 11:30:41,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-01-09 11:30:41,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 11:30:41,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 11:30:41,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:41,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:41,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:30:41,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 904 proven. 33 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-01-09 11:30:42,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:30:43,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:30:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509245704] [2025-01-09 11:30:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509245704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:30:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2075024467] [2025-01-09 11:30:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:43,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:30:43,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:30:43,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:30:43,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 11:30:43,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 11:30:44,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 11:30:44,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:44,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:44,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:30:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 11:30:44,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:30:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 11:30:45,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2075024467] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:30:45,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:30:45,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-09 11:30:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881733934] [2025-01-09 11:30:45,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:30:45,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 11:30:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:30:45,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 11:30:45,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:30:45,142 INFO L87 Difference]: Start difference. First operand 233 states and 355 transitions. Second operand has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 4 states have call successors, (77), 4 states have call predecessors, (77), 7 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-01-09 11:30:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:30:59,127 INFO L93 Difference]: Finished difference Result 875 states and 1292 transitions. [2025-01-09 11:30:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-09 11:30:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 4 states have call successors, (77), 4 states have call predecessors, (77), 7 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) Word has length 201 [2025-01-09 11:30:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:30:59,131 INFO L225 Difference]: With dead ends: 875 [2025-01-09 11:30:59,131 INFO L226 Difference]: Without dead ends: 698 [2025-01-09 11:30:59,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 609 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=833, Invalid=3457, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 11:30:59,133 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 986 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 799 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:30:59,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1402 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 1558 Invalid, 3 Unknown, 0 Unchecked, 10.0s Time] [2025-01-09 11:30:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-01-09 11:30:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 249. [2025-01-09 11:30:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 147 states have internal predecessors, (181), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:30:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 367 transitions. [2025-01-09 11:30:59,181 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 367 transitions. Word has length 201 [2025-01-09 11:30:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:30:59,181 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 367 transitions. [2025-01-09 11:30:59,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 4 states have call successors, (77), 4 states have call predecessors, (77), 7 states have return successors, (78), 4 states have call predecessors, (78), 4 states have call successors, (78) [2025-01-09 11:30:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 367 transitions. [2025-01-09 11:30:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 11:30:59,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:30:59,183 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:30:59,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 11:30:59,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Ended with exit code 0 [2025-01-09 11:30:59,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/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-01-09 11:30:59,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:30:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:30:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1771160666, now seen corresponding path program 1 times [2025-01-09 11:30:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:30:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517638166] [2025-01-09 11:30:59,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:30:59,585 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-01-09 11:30:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:30:59,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-01-09 11:30:59,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Waiting until timeout for monitored process [2025-01-09 11:30:59,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 11:30:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 11:30:59,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:30:59,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:30:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:30:59,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:30:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:30:59,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:30:59,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:30:59,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517638166] [2025-01-09 11:30:59,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517638166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:30:59,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:30:59,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:30:59,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083234668] [2025-01-09 11:30:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:30:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:30:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:30:59,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:30:59,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:30:59,951 INFO L87 Difference]: Start difference. First operand 249 states and 367 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:31:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:00,762 INFO L93 Difference]: Finished difference Result 540 states and 800 transitions. [2025-01-09 11:31:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:31:00,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-01-09 11:31:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:00,765 INFO L225 Difference]: With dead ends: 540 [2025-01-09 11:31:00,765 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 11:31:00,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-01-09 11:31:00,768 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 129 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:00,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 380 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:31:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 11:31:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 246. [2025-01-09 11:31:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 143 states have (on average 1.2307692307692308) internal successors, (176), 144 states have internal predecessors, (176), 93 states have call successors, (93), 9 states have call predecessors, (93), 9 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 11:31:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 362 transitions. [2025-01-09 11:31:00,802 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 362 transitions. Word has length 201 [2025-01-09 11:31:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 362 transitions. [2025-01-09 11:31:00,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 11:31:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 362 transitions. [2025-01-09 11:31:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 11:31:00,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:00,804 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:31:00,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Ended with exit code 0 [2025-01-09 11:31:01,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-01-09 11:31:01,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:01,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash -35876541, now seen corresponding path program 1 times [2025-01-09 11:31:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:31:01,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256647535] [2025-01-09 11:31:01,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:01,006 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-01-09 11:31:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:31:01,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-01-09 11:31:01,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (9)] Waiting until timeout for monitored process [2025-01-09 11:31:01,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 11:31:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 11:31:01,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:01,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:01,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 11:31:01,364 INFO L279 TraceCheckSpWp]: Computing forward predicates...