./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.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_loopvsstraightlinecode_100-while_file-36.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 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:05:25,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:05:25,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:05:25,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:05:25,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:05:25,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:05:25,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:05:25,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:05:25,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:05:25,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:05:25,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:05:25,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:05:25,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:05:25,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:05:25,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:05:25,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:05:25,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:05:25,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:05:25,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:05:25,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:05:25,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:25,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:25,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:05:25,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:05:25,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:05:25,172 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 -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 [2025-01-09 13:05:25,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:05:25,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:05:25,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:05:25,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:05:25,463 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:05:25,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:26,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b402fc78b/60355aa535cb4839a5108f6e5b495bfd/FLAG07242e436 [2025-01-09 13:05:27,066 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:05:27,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:27,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b402fc78b/60355aa535cb4839a5108f6e5b495bfd/FLAG07242e436 [2025-01-09 13:05:27,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b402fc78b/60355aa535cb4839a5108f6e5b495bfd [2025-01-09 13:05:27,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:05:27,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:05:27,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:05:27,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:05:27,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:05:27,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdddd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27, skipping insertion in model container [2025-01-09 13:05:27,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:05:27,271 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_loopvsstraightlinecode_100-while_file-36.i[916,929] [2025-01-09 13:05:27,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:05:27,386 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:05:27,396 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_loopvsstraightlinecode_100-while_file-36.i[916,929] [2025-01-09 13:05:27,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:05:27,458 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:05:27,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27 WrapperNode [2025-01-09 13:05:27,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:05:27,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:05:27,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:05:27,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:05:27,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,522 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 331 [2025-01-09 13:05:27,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:05:27,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:05:27,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:05:27,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:05:27,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,567 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 13:05:27,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:05:27,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:05:27,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:05:27,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:05:27,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (1/1) ... [2025-01-09 13:05:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:27,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:27,664 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 13:05:27,671 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 13:05:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:05:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:05:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:05:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:05:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:05:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:05:27,782 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:05:27,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:05:28,512 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 13:05:28,513 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:05:28,531 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:05:28,533 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:05:28,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:05:28 BoogieIcfgContainer [2025-01-09 13:05:28,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:05:28,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:05:28,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:05:28,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:05:28,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:05:27" (1/3) ... [2025-01-09 13:05:28,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5713e4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:05:28, skipping insertion in model container [2025-01-09 13:05:28,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:27" (2/3) ... [2025-01-09 13:05:28,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5713e4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:05:28, skipping insertion in model container [2025-01-09 13:05:28,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:05:28" (3/3) ... [2025-01-09 13:05:28,548 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:28,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:05:28,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-36.i that has 2 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:05:28,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:05:28,652 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;@10402bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:05:28,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:05:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:05:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:05:28,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:28,673 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:28,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1514745377, now seen corresponding path program 1 times [2025-01-09 13:05:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890939456] [2025-01-09 13:05:28,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:05:28,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:05:28,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:28,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:05:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890939456] [2025-01-09 13:05:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890939456] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:05:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515076215] [2025-01-09 13:05:29,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:05:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:29,039 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 13:05:29,041 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 13:05:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:05:29,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:05:29,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:29,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:05:29,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:05:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:05:29,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:05:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515076215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:05:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:05:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624411455] [2025-01-09 13:05:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:29,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:05:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:05:29,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:05:29,338 INFO L87 Difference]: Start difference. First operand has 140 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:05:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:29,380 INFO L93 Difference]: Finished difference Result 274 states and 459 transitions. [2025-01-09 13:05:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:05:29,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 195 [2025-01-09 13:05:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:29,393 INFO L225 Difference]: With dead ends: 274 [2025-01-09 13:05:29,393 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 13:05:29,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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 13:05:29,399 INFO L435 NwaCegarLoop]: 213 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, 213 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 13:05:29,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:05:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 13:05:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 13:05:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 107 states have internal predecessors, (157), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:05:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 213 transitions. [2025-01-09 13:05:29,453 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 213 transitions. Word has length 195 [2025-01-09 13:05:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:29,453 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 213 transitions. [2025-01-09 13:05:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:05:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 213 transitions. [2025-01-09 13:05:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:05:29,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:29,458 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:29,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:05:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:05:29,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1816764585, now seen corresponding path program 1 times [2025-01-09 13:05:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750654576] [2025-01-09 13:05:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:05:29,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:05:29,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:29,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750654576] [2025-01-09 13:05:30,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750654576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:30,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:30,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:05:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913910972] [2025-01-09 13:05:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:05:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:30,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:05:30,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:05:30,063 INFO L87 Difference]: Start difference. First operand 137 states and 213 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:30,183 INFO L93 Difference]: Finished difference Result 271 states and 423 transitions. [2025-01-09 13:05:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:05:30,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-01-09 13:05:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:30,190 INFO L225 Difference]: With dead ends: 271 [2025-01-09 13:05:30,192 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 13:05:30,193 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 13:05:30,194 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:30,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:05:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 13:05:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 13:05:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 107 states have internal predecessors, (156), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:05:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2025-01-09 13:05:30,212 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 195 [2025-01-09 13:05:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:30,213 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2025-01-09 13:05:30,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2025-01-09 13:05:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 13:05:30,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:30,216 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:30,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:05:30,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:30,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:30,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1207505424, now seen corresponding path program 1 times [2025-01-09 13:05:30,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:30,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135044709] [2025-01-09 13:05:30,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:30,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 13:05:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 13:05:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:30,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135044709] [2025-01-09 13:05:30,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135044709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:30,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:30,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:05:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012666542] [2025-01-09 13:05:30,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:05:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:05:30,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:05:30,512 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:30,655 INFO L93 Difference]: Finished difference Result 395 states and 616 transitions. [2025-01-09 13:05:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:05:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-01-09 13:05:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:30,659 INFO L225 Difference]: With dead ends: 395 [2025-01-09 13:05:30,659 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 13:05:30,660 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 13:05:30,660 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 179 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:30,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:05:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 13:05:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-01-09 13:05:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 199 states have internal predecessors, (285), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 13:05:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 397 transitions. [2025-01-09 13:05:30,699 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 397 transitions. Word has length 197 [2025-01-09 13:05:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 397 transitions. [2025-01-09 13:05:30,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 397 transitions. [2025-01-09 13:05:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:05:30,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:30,704 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:30,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:05:30,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1749075969, now seen corresponding path program 1 times [2025-01-09 13:05:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980828307] [2025-01-09 13:05:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:30,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:05:30,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:05:30,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:30,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980828307] [2025-01-09 13:05:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980828307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:30,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:05:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267931876] [2025-01-09 13:05:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:30,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:05:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:30,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:05:30,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:05:30,889 INFO L87 Difference]: Start difference. First operand 258 states and 397 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:30,955 INFO L93 Difference]: Finished difference Result 766 states and 1181 transitions. [2025-01-09 13:05:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:05:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2025-01-09 13:05:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:30,962 INFO L225 Difference]: With dead ends: 766 [2025-01-09 13:05:30,962 INFO L226 Difference]: Without dead ends: 511 [2025-01-09 13:05:30,963 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 13:05:30,964 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 201 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:30,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 406 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:05:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-01-09 13:05:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2025-01-09 13:05:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 390 states have (on average 1.4205128205128206) internal successors, (554), 390 states have internal predecessors, (554), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 13:05:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 778 transitions. [2025-01-09 13:05:31,024 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 778 transitions. Word has length 198 [2025-01-09 13:05:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 778 transitions. [2025-01-09 13:05:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 778 transitions. [2025-01-09 13:05:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:05:31,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:31,029 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:31,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:05:31,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:31,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1959085313, now seen corresponding path program 1 times [2025-01-09 13:05:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314355517] [2025-01-09 13:05:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:31,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:05:31,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:05:31,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314355517] [2025-01-09 13:05:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314355517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:05:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086798975] [2025-01-09 13:05:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:31,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:05:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:31,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:05:31,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:05:31,314 INFO L87 Difference]: Start difference. First operand 507 states and 778 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:31,487 INFO L93 Difference]: Finished difference Result 1275 states and 1964 transitions. [2025-01-09 13:05:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:05:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2025-01-09 13:05:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:31,495 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 13:05:31,498 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 13:05:31,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 13:05:31,501 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 192 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:31,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 444 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:05:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 13:05:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 767. [2025-01-09 13:05:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 592 states have (on average 1.4256756756756757) internal successors, (844), 592 states have internal predecessors, (844), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 13:05:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1180 transitions. [2025-01-09 13:05:31,584 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1180 transitions. Word has length 198 [2025-01-09 13:05:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1180 transitions. [2025-01-09 13:05:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1180 transitions. [2025-01-09 13:05:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:05:31,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:31,592 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:05:31,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash 914019217, now seen corresponding path program 1 times [2025-01-09 13:05:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839809132] [2025-01-09 13:05:31,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:05:31,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:05:31,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:31,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839809132] [2025-01-09 13:05:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839809132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:05:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46229869] [2025-01-09 13:05:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:05:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:31,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:05:31,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:05:31,941 INFO L87 Difference]: Start difference. First operand 767 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:32,292 INFO L93 Difference]: Finished difference Result 1555 states and 2392 transitions. [2025-01-09 13:05:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:05:32,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2025-01-09 13:05:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:32,300 INFO L225 Difference]: With dead ends: 1555 [2025-01-09 13:05:32,300 INFO L226 Difference]: Without dead ends: 785 [2025-01-09 13:05:32,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:05:32,304 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 307 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:32,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 691 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:05:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-01-09 13:05:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 775. [2025-01-09 13:05:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 600 states have (on average 1.4233333333333333) internal successors, (854), 600 states have internal predecessors, (854), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 13:05:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1190 transitions. [2025-01-09 13:05:32,400 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1190 transitions. Word has length 198 [2025-01-09 13:05:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:32,401 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1190 transitions. [2025-01-09 13:05:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1190 transitions. [2025-01-09 13:05:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:05:32,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:32,406 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:05:32,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -891419117, now seen corresponding path program 1 times [2025-01-09 13:05:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793697847] [2025-01-09 13:05:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:05:32,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:05:32,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:32,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:32,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793697847] [2025-01-09 13:05:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793697847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:05:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203409522] [2025-01-09 13:05:32,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:32,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:05:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:32,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:05:32,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:05:32,769 INFO L87 Difference]: Start difference. First operand 775 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:33,136 INFO L93 Difference]: Finished difference Result 2055 states and 3158 transitions. [2025-01-09 13:05:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:05:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2025-01-09 13:05:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:33,147 INFO L225 Difference]: With dead ends: 2055 [2025-01-09 13:05:33,147 INFO L226 Difference]: Without dead ends: 1283 [2025-01-09 13:05:33,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:05:33,151 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 189 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:33,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 443 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:05:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-01-09 13:05:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1039. [2025-01-09 13:05:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 806 states have (on average 1.4267990074441688) internal successors, (1150), 806 states have internal predecessors, (1150), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 13:05:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1598 transitions. [2025-01-09 13:05:33,251 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1598 transitions. Word has length 198 [2025-01-09 13:05:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:33,252 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1598 transitions. [2025-01-09 13:05:33,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1598 transitions. [2025-01-09 13:05:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 13:05:33,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:33,255 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:05:33,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:33,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1127141058, now seen corresponding path program 1 times [2025-01-09 13:05:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717855189] [2025-01-09 13:05:33,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:33,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 13:05:33,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 13:05:33,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:05:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:33,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717855189] [2025-01-09 13:05:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717855189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:05:33,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439495145] [2025-01-09 13:05:33,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:05:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:33,667 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 13:05:33,671 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 13:05:33,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 13:05:33,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 13:05:33,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:33,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:33,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:05:33,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:05:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 763 proven. 33 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-09 13:05:34,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:05:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:05:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439495145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:05:34,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:05:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-01-09 13:05:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96065397] [2025-01-09 13:05:34,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:05:34,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:05:34,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:34,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:05:34,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:05:34,355 INFO L87 Difference]: Start difference. First operand 1039 states and 1598 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 13:05:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:35,068 INFO L93 Difference]: Finished difference Result 2487 states and 3720 transitions. [2025-01-09 13:05:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:05:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 199 [2025-01-09 13:05:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:35,079 INFO L225 Difference]: With dead ends: 2487 [2025-01-09 13:05:35,079 INFO L226 Difference]: Without dead ends: 1435 [2025-01-09 13:05:35,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:05:35,083 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 580 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:35,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 507 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:05:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-01-09 13:05:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1363. [2025-01-09 13:05:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1064 states have (on average 1.3590225563909775) internal successors, (1446), 1070 states have internal predecessors, (1446), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 13:05:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1978 transitions. [2025-01-09 13:05:35,221 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1978 transitions. Word has length 199 [2025-01-09 13:05:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:35,221 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1978 transitions. [2025-01-09 13:05:35,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 13:05:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1978 transitions. [2025-01-09 13:05:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 13:05:35,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:35,224 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:35,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:05:35,429 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 13:05:35,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:35,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1272503014, now seen corresponding path program 1 times [2025-01-09 13:05:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:35,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023341037] [2025-01-09 13:05:35,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:35,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 13:05:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 13:05:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023341037] [2025-01-09 13:05:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023341037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:05:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055584897] [2025-01-09 13:05:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:05:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:35,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:05:35,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:05:35,519 INFO L87 Difference]: Start difference. First operand 1363 states and 1978 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:35,642 INFO L93 Difference]: Finished difference Result 3323 states and 4820 transitions. [2025-01-09 13:05:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:05:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 199 [2025-01-09 13:05:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:35,657 INFO L225 Difference]: With dead ends: 3323 [2025-01-09 13:05:35,657 INFO L226 Difference]: Without dead ends: 1963 [2025-01-09 13:05:35,662 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 13:05:35,662 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 110 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:35,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 453 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:05:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-01-09 13:05:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1617. [2025-01-09 13:05:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1318 states have (on average 1.3672230652503794) internal successors, (1802), 1324 states have internal predecessors, (1802), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 13:05:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2334 transitions. [2025-01-09 13:05:35,783 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2334 transitions. Word has length 199 [2025-01-09 13:05:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:35,784 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2334 transitions. [2025-01-09 13:05:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2334 transitions. [2025-01-09 13:05:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 13:05:35,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:35,787 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:35,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:05:35,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1582786070, now seen corresponding path program 1 times [2025-01-09 13:05:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994156807] [2025-01-09 13:05:35,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:35,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 13:05:35,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 13:05:35,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:35,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:05:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994156807] [2025-01-09 13:05:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994156807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:05:36,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:05:36,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:05:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974560185] [2025-01-09 13:05:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:05:36,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:05:36,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:36,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:05:36,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:05:36,083 INFO L87 Difference]: Start difference. First operand 1617 states and 2334 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:36,392 INFO L93 Difference]: Finished difference Result 3609 states and 5154 transitions. [2025-01-09 13:05:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:05:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 200 [2025-01-09 13:05:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:36,405 INFO L225 Difference]: With dead ends: 3609 [2025-01-09 13:05:36,406 INFO L226 Difference]: Without dead ends: 1995 [2025-01-09 13:05:36,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 13:05:36,411 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 292 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:36,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 696 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:05:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-09 13:05:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1651. [2025-01-09 13:05:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1359 states have (on average 1.3524650478292863) internal successors, (1838), 1365 states have internal predecessors, (1838), 259 states have call successors, (259), 32 states have call predecessors, (259), 32 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2025-01-09 13:05:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2356 transitions. [2025-01-09 13:05:36,548 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2356 transitions. Word has length 200 [2025-01-09 13:05:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:36,549 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2356 transitions. [2025-01-09 13:05:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:05:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2356 transitions. [2025-01-09 13:05:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 13:05:36,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:36,552 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:36,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:05:36,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:36,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1385356009, now seen corresponding path program 1 times [2025-01-09 13:05:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583313872] [2025-01-09 13:05:36,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:36,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 13:05:36,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 13:05:36,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:36,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:05:37,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:05:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583313872] [2025-01-09 13:05:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583313872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:05:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881900115] [2025-01-09 13:05:37,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:37,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:05:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:37,225 INFO L229 MonitoredProcess]: Starting monitored process 4 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 13:05:37,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:05:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 13:05:37,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 13:05:37,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:37,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:37,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:05:37,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:05:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-01-09 13:05:37,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:05:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:05:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881900115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:05:38,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:05:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2025-01-09 13:05:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371006494] [2025-01-09 13:05:38,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:05:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:05:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:05:38,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:05:38,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:05:38,018 INFO L87 Difference]: Start difference. First operand 1651 states and 2356 transitions. Second operand has 15 states, 15 states have (on average 7.733333333333333) internal successors, (116), 15 states have internal predecessors, (116), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 13:05:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:05:40,495 INFO L93 Difference]: Finished difference Result 7536 states and 10407 transitions. [2025-01-09 13:05:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 13:05:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.733333333333333) internal successors, (116), 15 states have internal predecessors, (116), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 203 [2025-01-09 13:05:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:05:40,529 INFO L225 Difference]: With dead ends: 7536 [2025-01-09 13:05:40,529 INFO L226 Difference]: Without dead ends: 5888 [2025-01-09 13:05:40,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=641, Invalid=1711, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 13:05:40,539 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1754 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:05:40,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 1025 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 13:05:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2025-01-09 13:05:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 1712. [2025-01-09 13:05:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1429 states have (on average 1.3268019594121763) internal successors, (1896), 1441 states have internal predecessors, (1896), 242 states have call successors, (242), 40 states have call predecessors, (242), 40 states have return successors, (242), 230 states have call predecessors, (242), 242 states have call successors, (242) [2025-01-09 13:05:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2380 transitions. [2025-01-09 13:05:40,727 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2380 transitions. Word has length 203 [2025-01-09 13:05:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:05:40,730 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2380 transitions. [2025-01-09 13:05:40,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.733333333333333) internal successors, (116), 15 states have internal predecessors, (116), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 13:05:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2380 transitions. [2025-01-09 13:05:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 13:05:40,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:40,732 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:40,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:05:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:05:40,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1244807399, now seen corresponding path program 1 times [2025-01-09 13:05:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:05:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613503584] [2025-01-09 13:05:40,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:05:40,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 13:05:41,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 13:05:41,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:41,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:05:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033211355] [2025-01-09 13:05:41,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:05:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:41,091 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:05:41,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 13:05:41,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 13:05:41,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 13:05:41,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:41,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:05:41,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:05:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 13:05:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 13:05:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:05:41,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:05:41,433 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:05:41,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:05:41,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 13:05:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 13:05:41,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:05:41,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:05:41,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:05:41 BoogieIcfgContainer [2025-01-09 13:05:41,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:05:41,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:05:41,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:05:41,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:05:41,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:05:28" (3/4) ... [2025-01-09 13:05:41,806 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:05:41,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:05:41,809 INFO L158 Benchmark]: Toolchain (without parser) took 14713.80ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 104.2MB in the beginning and 299.9MB in the end (delta: -195.7MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,809 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:05:41,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.93ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 87.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.46ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 82.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,810 INFO L158 Benchmark]: Boogie Preprocessor took 105.62ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 75.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,810 INFO L158 Benchmark]: RCFGBuilder took 904.45ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 37.5MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,810 INFO L158 Benchmark]: TraceAbstraction took 13265.59ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 36.4MB in the beginning and 300.0MB in the end (delta: -263.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,811 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 419.4MB. Free memory was 300.0MB in the beginning and 299.9MB in the end (delta: 84.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:05:41,812 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.93ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 87.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.46ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 82.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.62ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 75.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 904.45ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 37.5MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13265.59ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 36.4MB in the beginning and 300.0MB in the end (delta: -263.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 419.4MB. Free memory was 300.0MB in the beginning and 299.9MB in the end (delta: 84.1kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 107, overapproximation of shiftRight at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of bitwiseOr at line 116, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = -0.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_4 = 32.5; [L25] float var_1_5 = 10.25; [L26] float var_1_6 = 15.2; [L27] unsigned short int var_1_7 = 1; [L28] unsigned short int var_1_10 = 1; [L29] signed short int var_1_12 = 8; [L30] signed short int var_1_13 = -16; [L31] unsigned long int var_1_16 = 0; [L32] unsigned long int var_1_17 = 1790089366; [L33] unsigned long int var_1_18 = 1816612959; [L34] unsigned long int var_1_19 = 2; [L35] unsigned char var_1_20 = 32; [L36] unsigned char var_1_21 = 32; [L37] unsigned short int var_1_22 = 256; [L38] unsigned short int var_1_23 = 21380; [L39] signed char var_1_25 = 8; [L40] signed char var_1_26 = 0; [L41] signed char var_1_27 = 32; [L42] signed char var_1_28 = 32; [L43] double var_1_29 = 99999999.2; [L44] double var_1_31 = 64.25; [L45] double var_1_32 = 100.6; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] unsigned short int var_1_35 = 4; [L49] unsigned long int last_1_var_1_16 = 0; [L50] unsigned long int last_1_var_1_19 = 2; [L51] unsigned char last_1_var_1_20 = 32; [L52] signed char last_1_var_1_25 = 8; [L53] unsigned char last_1_var_1_33 = 0; VAL [isInitial=0, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L206] isInitial = 1 [L207] FCALL initially() [L209] CALL updateLastVariables() [L195] last_1_var_1_16 = var_1_16 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_20 = var_1_20 [L198] last_1_var_1_25 = var_1_25 [L199] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L150] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L152] var_1_4 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L154] var_1_5 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L156] var_1_6 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L158] var_1_10 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L159] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L161] var_1_12 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L162] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L165] var_1_17 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_17 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L166] RET assume_abort_if_not(var_1_17 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_17 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] RET assume_abort_if_not(var_1_17 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L168] var_1_18 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_18 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L169] RET assume_abort_if_not(var_1_18 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L174] var_1_23 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_23 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L175] RET assume_abort_if_not(var_1_23 >= 16383) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] CALL assume_abort_if_not(var_1_23 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] RET assume_abort_if_not(var_1_23 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L177] var_1_26 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L178] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L180] var_1_27 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L181] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L183] var_1_28 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L184] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L186] var_1_31 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L187] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L188] var_1_32 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_35=4, var_1_7=1] [L192] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L192] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L210] RET updateVariables() [L211] CALL step() [L57] COND FALSE !(\read(last_1_var_1_33)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L66] COND TRUE var_1_6 == (- (99.4f * var_1_4)) [L67] var_1_25 = (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] EXPR var_1_10 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] unsigned long int stepLocal_3 = last_1_var_1_16 * (var_1_10 & last_1_var_1_25); [L76] COND FALSE !(\read(last_1_var_1_33)) [L85] var_1_20 = 100 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L87] signed char stepLocal_2 = var_1_25; [L88] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L89] COND TRUE stepLocal_2 <= last_1_var_1_16 [L90] var_1_16 = ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L96] unsigned long int stepLocal_5 = var_1_16; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_5=3808567485, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L97] COND FALSE !(var_1_18 >= stepLocal_5) [L104] var_1_29 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=2, var_1_7=1] [L106] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)))) [L108] var_1_13 = 8 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L112] COND FALSE !(var_1_13 >= var_1_18) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L115] signed short int stepLocal_6 = var_1_13; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] EXPR var_1_20 ^ var_1_23 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] COND TRUE (var_1_20 ^ var_1_23) > stepLocal_6 [L117] COND TRUE ! (var_1_18 == (var_1_20 + var_1_7)) [L118] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L127] unsigned long int stepLocal_0 = var_1_19; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L128] COND FALSE !(\read(var_1_33)) [L135] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L137] unsigned char stepLocal_4 = var_1_20; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, stepLocal_4=100, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L138] COND FALSE !(stepLocal_4 < var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L141] COND FALSE !(\read(var_1_33)) [L144] var_1_22 = 2 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR ((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202-L203] return ((((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))) && (var_1_35 == ((unsigned short int) var_1_7)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=1610612735, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=0, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3843 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3804 mSDsluCounter, 5733 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3129 mSDsCounter, 640 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2000 IncrementalHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 640 mSolverCounterUnsat, 2604 mSDtfsCounter, 2000 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1105 GetRequests, 1024 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1712occurred in iteration=11, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 5203 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3183 NumberOfCodeBlocks, 3183 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3163 ConstructedInterpolants, 0 QuantifiedInterpolants, 5166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1376 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 23883/24192 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 13:05:41,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_loopvsstraightlinecode_100-while_file-36.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 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:05:44,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:05:44,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:05:44,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:05:44,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:05:44,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:05:44,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:05:44,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:05:44,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:05:44,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:05:44,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:05:44,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:05:44,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:05:44,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:05:44,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:05:44,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:05:44,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:05:44,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:05:44,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:44,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:05:44,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:44,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:05:44,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:05:44,319 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 -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 [2025-01-09 13:05:44,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:05:44,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:05:44,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:05:44,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:05:44,638 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:05:44,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:46,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc2427096/1f3fcfd7f1ad47e1bc1ea6029092c6e8/FLAG50fbdccae [2025-01-09 13:05:46,301 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:05:46,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:46,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc2427096/1f3fcfd7f1ad47e1bc1ea6029092c6e8/FLAG50fbdccae [2025-01-09 13:05:46,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc2427096/1f3fcfd7f1ad47e1bc1ea6029092c6e8 [2025-01-09 13:05:46,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:05:46,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:05:46,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:05:46,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:05:46,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:05:46,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0fcc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46, skipping insertion in model container [2025-01-09 13:05:46,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:05:46,763 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_loopvsstraightlinecode_100-while_file-36.i[916,929] [2025-01-09 13:05:46,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:05:46,854 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:05:46,868 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_loopvsstraightlinecode_100-while_file-36.i[916,929] [2025-01-09 13:05:46,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:05:46,921 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:05:46,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46 WrapperNode [2025-01-09 13:05:46,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:05:46,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:05:46,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:05:46,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:05:46,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,984 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-01-09 13:05:46,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:05:46,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:05:46,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:05:46,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:05:46,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:46,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,017 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 13:05:47,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:05:47,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:05:47,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:05:47,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:05:47,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (1/1) ... [2025-01-09 13:05:47,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:05:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:05:47,090 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 13:05:47,098 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 13:05:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:05:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:05:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:05:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:05:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:05:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:05:47,217 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:05:47,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:05:52,270 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 13:05:52,270 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:05:52,280 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:05:52,280 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:05:52,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:05:52 BoogieIcfgContainer [2025-01-09 13:05:52,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:05:52,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:05:52,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:05:52,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:05:52,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:05:46" (1/3) ... [2025-01-09 13:05:52,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5936c051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:05:52, skipping insertion in model container [2025-01-09 13:05:52,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:05:46" (2/3) ... [2025-01-09 13:05:52,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5936c051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:05:52, skipping insertion in model container [2025-01-09 13:05:52,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:05:52" (3/3) ... [2025-01-09 13:05:52,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i [2025-01-09 13:05:52,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:05:52,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-36.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:05:52,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:05:52,357 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;@2fc14de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:05:52,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:05:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:05:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 13:05:52,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:05:52,374 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:52,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:05:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:05:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1112962641, now seen corresponding path program 1 times [2025-01-09 13:05:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:05:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948317528] [2025-01-09 13:05:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:05:52,388 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 13:05:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:05:52,390 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 13:05:52,392 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 13:05:52,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 13:05:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 13:05:52,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:05:52,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:05:52,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:05:52,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:05:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 788 proven. 84 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-01-09 13:05:54,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:05:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:05:56,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:05:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948317528] [2025-01-09 13:05:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948317528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:05:56,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:05:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2025-01-09 13:05:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214200318] [2025-01-09 13:05:56,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:05:56,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:05:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:05:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:05:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:05:56,115 INFO L87 Difference]: Start difference. First operand has 90 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 13:06:01,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:06:03,337 INFO L93 Difference]: Finished difference Result 271 states and 470 transitions. [2025-01-09 13:06:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 13:06:03,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 183 [2025-01-09 13:06:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:06:03,351 INFO L225 Difference]: With dead ends: 271 [2025-01-09 13:06:03,352 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 13:06:03,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:06:03,360 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 264 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 89 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:06:03,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 443 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 425 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2025-01-09 13:06:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 13:06:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 134. [2025-01-09 13:06:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 90 states have internal predecessors, (117), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:06:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2025-01-09 13:06:03,424 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 183 [2025-01-09 13:06:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:06:03,426 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2025-01-09 13:06:03,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 13:06:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2025-01-09 13:06:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 13:06:03,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:06:03,431 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:03,443 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 13:06:03,632 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 13:06:03,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:06:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:06:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -854797203, now seen corresponding path program 1 times [2025-01-09 13:06:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:06:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393814420] [2025-01-09 13:06:03,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:06:03,634 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 13:06:03,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:06:03,636 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 13:06:03,637 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 13:06:03,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 13:06:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 13:06:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:06:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:06:03,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:06:03,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:06:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:06:04,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:06:04,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:06:04,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393814420] [2025-01-09 13:06:04,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393814420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:06:04,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:06:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:06:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204002387] [2025-01-09 13:06:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:06:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:06:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:06:04,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:06:04,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:06:04,147 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:06:08,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:12,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:16,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:18,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:06:19,406 INFO L93 Difference]: Finished difference Result 396 states and 585 transitions. [2025-01-09 13:06:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:06:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2025-01-09 13:06:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:06:19,413 INFO L225 Difference]: With dead ends: 396 [2025-01-09 13:06:19,414 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 13:06:19,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:06:19,417 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:06:19,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 480 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-01-09 13:06:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 13:06:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2025-01-09 13:06:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 173 states have (on average 1.30635838150289) internal successors, (226), 175 states have internal predecessors, (226), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 13:06:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 386 transitions. [2025-01-09 13:06:19,477 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 386 transitions. Word has length 183 [2025-01-09 13:06:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:06:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 386 transitions. [2025-01-09 13:06:19,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:06:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2025-01-09 13:06:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 13:06:19,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:06:19,482 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:19,499 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 13:06:19,682 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 13:06:19,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:06:19,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:06:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash -675407635, now seen corresponding path program 1 times [2025-01-09 13:06:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:06:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139266111] [2025-01-09 13:06:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:06:19,684 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 13:06:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:06:19,687 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 13:06:19,690 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 13:06:19,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 13:06:20,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 13:06:20,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:06:20,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:06:20,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:06:20,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:06:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:06:20,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:06:20,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:06:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139266111] [2025-01-09 13:06:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139266111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:06:20,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:06:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:06:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500824633] [2025-01-09 13:06:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:06:20,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:06:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:06:20,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:06:20,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:06:20,427 INFO L87 Difference]: Start difference. First operand 262 states and 386 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:06:25,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:28,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:06:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:06:29,029 INFO L93 Difference]: Finished difference Result 537 states and 779 transitions. [2025-01-09 13:06:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:06:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2025-01-09 13:06:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:06:29,072 INFO L225 Difference]: With dead ends: 537 [2025-01-09 13:06:29,073 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 13:06:29,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:06:29,075 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 137 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 115 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:06:29,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 226 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2025-01-09 13:06:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 13:06:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2025-01-09 13:06:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 177 states have internal predecessors, (216), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 13:06:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2025-01-09 13:06:29,121 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 184 [2025-01-09 13:06:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:06:29,122 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2025-01-09 13:06:29,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:06:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2025-01-09 13:06:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 13:06:29,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:06:29,125 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:29,140 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 13:06:29,325 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 [2025-01-09 13:06:29,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:06:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:06:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash -673560593, now seen corresponding path program 1 times [2025-01-09 13:06:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:06:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575392008] [2025-01-09 13:06:29,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:06:29,327 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 13:06:29,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:06:29,330 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:06:29,331 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 (5)] Waiting until timeout for monitored process [2025-01-09 13:06:29,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 13:06:29,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 13:06:29,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:06:29,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:06:29,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:06:29,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:06:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-01-09 13:06:38,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:06:47,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:06:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575392008] [2025-01-09 13:06:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575392008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:06:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [660514424] [2025-01-09 13:06:47,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:06:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:06:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:06:47,865 INFO L229 MonitoredProcess]: Starting monitored process 6 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 13:06:47,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 13:06:47,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 13:06:48,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 13:06:48,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:06:48,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:06:48,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 13:06:48,928 INFO L279 TraceCheckSpWp]: Computing forward predicates...