./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.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-16.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 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:02:20,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:02:20,900 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:02:20,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:02:20,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:02:20,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:02:20,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:02:20,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:02:20,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:02:20,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:02:20,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:02:20,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:02:20,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:02:20,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:02:20,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:02:20,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:02:20,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:20,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:20,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:20,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:02:20,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:02:20,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:02:20,930 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 -> 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 [2025-01-09 13:02:21,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:02:21,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:02:21,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:02:21,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:02:21,272 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:02:21,273 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-16.i [2025-01-09 13:02:22,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e876cf8d6/f79502361d81475a97f205d21d195494/FLAG32cba0f2e [2025-01-09 13:02:22,828 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:02:22,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2025-01-09 13:02:22,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e876cf8d6/f79502361d81475a97f205d21d195494/FLAG32cba0f2e [2025-01-09 13:02:22,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e876cf8d6/f79502361d81475a97f205d21d195494 [2025-01-09 13:02:22,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:02:22,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:02:22,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:22,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:02:22,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:02:22,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:22" (1/1) ... [2025-01-09 13:02:22,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:22, skipping insertion in model container [2025-01-09 13:02:22,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:22" (1/1) ... [2025-01-09 13:02:22,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:02:23,031 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-16.i[916,929] [2025-01-09 13:02:23,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:23,161 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:02:23,169 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-16.i[916,929] [2025-01-09 13:02:23,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:23,239 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:02:23,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23 WrapperNode [2025-01-09 13:02:23,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:23,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:23,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:02:23,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:02:23,250 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:02:23" (1/1) ... [2025-01-09 13:02:23,265 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:02:23" (1/1) ... [2025-01-09 13:02:23,316 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2025-01-09 13:02:23,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:23,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:02:23,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:02:23,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:02:23,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,359 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:02:23,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:02:23,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:02:23,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:02:23,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:02:23,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (1/1) ... [2025-01-09 13:02:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:23,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:23,447 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:02:23,453 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:02:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:02:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:02:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:02:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:02:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:02:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:02:23,562 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:02:23,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:02:24,057 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 13:02:24,057 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:02:24,070 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:02:24,072 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:02:24,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:24 BoogieIcfgContainer [2025-01-09 13:02:24,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:02:24,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:02:24,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:02:24,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:02:24,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:02:22" (1/3) ... [2025-01-09 13:02:24,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a45eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:24, skipping insertion in model container [2025-01-09 13:02:24,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:23" (2/3) ... [2025-01-09 13:02:24,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a45eb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:24, skipping insertion in model container [2025-01-09 13:02:24,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:24" (3/3) ... [2025-01-09 13:02:24,082 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-16.i [2025-01-09 13:02:24,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:02:24,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-16.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:02:24,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:02:24,161 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;@e9901f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:02:24,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:02:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 74 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:02:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:24,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:24,180 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:24,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -157236690, now seen corresponding path program 1 times [2025-01-09 13:02:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627243921] [2025-01-09 13:02:24,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:24,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:24,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:02:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627243921] [2025-01-09 13:02:24,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627243921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:02:24,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934766904] [2025-01-09 13:02:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:24,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:02:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:25,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:02:25,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:02:25,016 INFO L87 Difference]: Start difference. First operand has 97 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 74 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:25,458 INFO L93 Difference]: Finished difference Result 371 states and 626 transitions. [2025-01-09 13:02:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:02:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-01-09 13:02:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:25,470 INFO L225 Difference]: With dead ends: 371 [2025-01-09 13:02:25,470 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 13:02:25,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:02:25,476 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 397 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:25,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 628 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:02:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 13:02:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185. [2025-01-09 13:02:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:02:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 286 transitions. [2025-01-09 13:02:25,545 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 286 transitions. Word has length 145 [2025-01-09 13:02:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 286 transitions. [2025-01-09 13:02:25,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 286 transitions. [2025-01-09 13:02:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:25,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:25,552 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:25,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 13:02:25,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:25,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1745584592, now seen corresponding path program 1 times [2025-01-09 13:02:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503099165] [2025-01-09 13:02:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:25,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:02:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503099165] [2025-01-09 13:02:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503099165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:26,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:02:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508609094] [2025-01-09 13:02:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:26,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:02:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:26,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:02:26,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:02:26,305 INFO L87 Difference]: Start difference. First operand 185 states and 286 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:26,761 INFO L93 Difference]: Finished difference Result 462 states and 713 transitions. [2025-01-09 13:02:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:02:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-01-09 13:02:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:26,767 INFO L225 Difference]: With dead ends: 462 [2025-01-09 13:02:26,767 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 13:02:26,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:02:26,769 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 219 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:26,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 444 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:02:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 13:02:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 188. [2025-01-09 13:02:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.4405594405594406) internal successors, (206), 143 states have internal predecessors, (206), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:02:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2025-01-09 13:02:26,818 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 145 [2025-01-09 13:02:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:26,819 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2025-01-09 13:02:26,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2025-01-09 13:02:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:26,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:26,826 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:02:26,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 774375342, now seen corresponding path program 1 times [2025-01-09 13:02:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198224324] [2025-01-09 13:02:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:26,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:26,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:26,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:02:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198224324] [2025-01-09 13:02:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198224324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:27,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:27,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:02:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155806150] [2025-01-09 13:02:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:02:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:27,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:02:27,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:02:27,538 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:27,910 INFO L93 Difference]: Finished difference Result 743 states and 1144 transitions. [2025-01-09 13:02:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:02:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-01-09 13:02:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:27,917 INFO L225 Difference]: With dead ends: 743 [2025-01-09 13:02:27,917 INFO L226 Difference]: Without dead ends: 558 [2025-01-09 13:02:27,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:02:27,920 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 515 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:27,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 792 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:02:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-09 13:02:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 367. [2025-01-09 13:02:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 267 states have (on average 1.3895131086142323) internal successors, (371), 268 states have internal predecessors, (371), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 13:02:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 557 transitions. [2025-01-09 13:02:28,000 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 557 transitions. Word has length 145 [2025-01-09 13:02:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:28,002 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 557 transitions. [2025-01-09 13:02:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 557 transitions. [2025-01-09 13:02:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:28,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:28,007 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:28,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:02:28,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:28,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1846180432, now seen corresponding path program 1 times [2025-01-09 13:02:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976620503] [2025-01-09 13:02:28,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:28,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:28,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:28,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:28,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:02:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:28,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976620503] [2025-01-09 13:02:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976620503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:28,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:02:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544581055] [2025-01-09 13:02:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:28,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:02:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:28,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:02:28,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:02:28,231 INFO L87 Difference]: Start difference. First operand 367 states and 557 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:28,583 INFO L93 Difference]: Finished difference Result 717 states and 1087 transitions. [2025-01-09 13:02:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:02:28,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-01-09 13:02:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:28,589 INFO L225 Difference]: With dead ends: 717 [2025-01-09 13:02:28,589 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 13:02:28,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:02:28,590 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 275 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 641 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:02:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 13:02:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2025-01-09 13:02:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 398 states have (on average 1.3894472361809045) internal successors, (553), 399 states have internal predecessors, (553), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 13:02:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 823 transitions. [2025-01-09 13:02:28,672 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 823 transitions. Word has length 145 [2025-01-09 13:02:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:28,672 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 823 transitions. [2025-01-09 13:02:28,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:02:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 823 transitions. [2025-01-09 13:02:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:28,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:28,674 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:02:28,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash -914568400, now seen corresponding path program 1 times [2025-01-09 13:02:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523322890] [2025-01-09 13:02:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:28,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:28,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:28,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:28,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:02:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523322890] [2025-01-09 13:02:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523322890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:02:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426965166] [2025-01-09 13:02:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:02:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:02:29,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:02:29,550 INFO L87 Difference]: Start difference. First operand 543 states and 823 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 13:02:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:30,089 INFO L93 Difference]: Finished difference Result 1322 states and 1994 transitions. [2025-01-09 13:02:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:02:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 145 [2025-01-09 13:02:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:30,096 INFO L225 Difference]: With dead ends: 1322 [2025-01-09 13:02:30,097 INFO L226 Difference]: Without dead ends: 796 [2025-01-09 13:02:30,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:02:30,101 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 276 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:30,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 479 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:02:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-01-09 13:02:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 623. [2025-01-09 13:02:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 465 states have (on average 1.389247311827957) internal successors, (646), 465 states have internal predecessors, (646), 147 states have call successors, (147), 10 states have call predecessors, (147), 10 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-01-09 13:02:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 940 transitions. [2025-01-09 13:02:30,196 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 940 transitions. Word has length 145 [2025-01-09 13:02:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:30,197 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 940 transitions. [2025-01-09 13:02:30,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 13:02:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 940 transitions. [2025-01-09 13:02:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:02:30,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:30,199 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:02:30,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:30,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1723915026, now seen corresponding path program 1 times [2025-01-09 13:02:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407966607] [2025-01-09 13:02:30,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:30,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:30,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:30,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:02:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:30,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407966607] [2025-01-09 13:02:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407966607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:02:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104667820] [2025-01-09 13:02:30,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:30,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:30,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:30,670 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:02:30,673 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:02:30,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:02:30,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:02:30,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:30,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:30,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 13:02:30,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:02:31,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:02:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:02:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104667820] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:02:31,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:02:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2025-01-09 13:02:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902333047] [2025-01-09 13:02:31,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:02:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 13:02:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:31,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 13:02:31,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:02:31,771 INFO L87 Difference]: Start difference. First operand 623 states and 940 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2025-01-09 13:02:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:33,337 INFO L93 Difference]: Finished difference Result 1492 states and 2234 transitions. [2025-01-09 13:02:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 13:02:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 145 [2025-01-09 13:02:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:33,344 INFO L225 Difference]: With dead ends: 1492 [2025-01-09 13:02:33,345 INFO L226 Difference]: Without dead ends: 947 [2025-01-09 13:02:33,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 13:02:33,350 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1188 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:33,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 1736 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 13:02:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-01-09 13:02:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 767. [2025-01-09 13:02:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 564 states have (on average 1.3563829787234043) internal successors, (765), 568 states have internal predecessors, (765), 186 states have call successors, (186), 16 states have call predecessors, (186), 16 states have return successors, (186), 182 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 13:02:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1137 transitions. [2025-01-09 13:02:33,461 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1137 transitions. Word has length 145 [2025-01-09 13:02:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:33,462 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1137 transitions. [2025-01-09 13:02:33,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2025-01-09 13:02:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1137 transitions. [2025-01-09 13:02:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:02:33,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:33,465 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:33,480 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:02:33,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:33,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1774397634, now seen corresponding path program 1 times [2025-01-09 13:02:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125266505] [2025-01-09 13:02:33,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:33,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:02:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:02:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:02:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224752909] [2025-01-09 13:02:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:33,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:33,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:33,782 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:02:33,784 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:02:33,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:02:33,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:02:33,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:33,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:02:33,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:02:33,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:02:33,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:02:33,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:33,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:02:34,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:02:34,094 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:02:34,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:02:34,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:02:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:34,301 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:02:34,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:02:34,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:02:34 BoogieIcfgContainer [2025-01-09 13:02:34,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:02:34,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:02:34,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:02:34,445 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:02:34,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:24" (3/4) ... [2025-01-09 13:02:34,448 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:02:34,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:02:34,450 INFO L158 Benchmark]: Toolchain (without parser) took 11581.65ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 130.2MB in the beginning and 172.5MB in the end (delta: -42.4MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,450 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:02:34,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.85ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 113.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.67ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:02:34,451 INFO L158 Benchmark]: Boogie Preprocessor took 88.33ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 103.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,452 INFO L158 Benchmark]: RCFGBuilder took 665.43ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 72.2MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,452 INFO L158 Benchmark]: TraceAbstraction took 10368.89ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 71.6MB in the beginning and 172.6MB in the end (delta: -101.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,452 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 276.8MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:02:34,454 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.31ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.85ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 113.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.67ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 109.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 88.33ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 103.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 665.43ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 72.2MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10368.89ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 71.6MB in the beginning and 172.6MB in the end (delta: -101.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 276.8MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 54.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 someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someUnaryFLOAToperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed char var_1_7 = -25; [L24] signed char var_1_9 = 50; [L25] signed char var_1_10 = -128; [L26] signed char var_1_11 = 0; [L27] signed char var_1_12 = -32; [L28] signed long int var_1_13 = 16; [L29] unsigned char var_1_14 = 1; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_18 = 0; [L32] unsigned char var_1_19 = 0; [L33] unsigned char var_1_20 = 0; [L34] float var_1_21 = 127.25; [L35] float var_1_23 = 1.5; [L36] float var_1_24 = 100.5; [L37] signed char var_1_25 = 0; [L38] signed char var_1_26 = -2; [L39] signed char var_1_27 = 0; [L40] signed long int var_1_28 = -128; [L41] float var_1_30 = 9.375; [L42] double var_1_31 = 99999999.875; [L43] double var_1_32 = 4.8; [L44] unsigned short int var_1_33 = 0; [L45] unsigned short int var_1_35 = 54252; [L46] unsigned short int var_1_37 = 5; [L47] unsigned char var_1_38 = 4; [L48] signed char var_1_39 = -64; [L49] signed char last_1_var_1_10 = -128; [L50] unsigned char last_1_var_1_18 = 0; [L51] signed char last_1_var_1_25 = 0; [L52] unsigned short int last_1_var_1_33 = 0; [L53] signed char last_1_var_1_39 = -64; VAL [isInitial=0, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50] [L183] isInitial = 1 [L184] FCALL initially() [L186] CALL updateLastVariables() [L172] last_1_var_1_10 = var_1_10 [L173] last_1_var_1_18 = var_1_18 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_33 = var_1_33 [L176] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L138] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L139] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L139] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L140] var_1_11 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L142] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L143] var_1_13 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L144] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L147] var_1_19 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L148] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L149] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L152] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L153] var_1_23 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L155] var_1_24 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L156] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L157] var_1_26 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L158] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L159] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L160] var_1_27 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L161] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L162] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L163] var_1_31 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L164] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L165] var_1_32 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L166] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L167] var_1_35 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_35 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L168] RET assume_abort_if_not(var_1_35 >= 49150) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L169] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L187] RET updateVariables() [L188] CALL step() [L57] unsigned char stepLocal_3 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_3=0, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L58] COND FALSE !(stepLocal_3 || var_1_20) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L61] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L65] var_1_18 = (! (var_1_19 || var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L66] COND TRUE (- var_1_24) < var_1_23 [L67] var_1_25 = (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=0] [L69] var_1_37 = var_1_11 [L70] var_1_38 = var_1_11 [L71] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-25, var_1_9=0] [L72] COND TRUE \read(var_1_18) [L73] var_1_7 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L75] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_1=0, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L76] COND FALSE !((last_1_var_1_10 + var_1_7) > stepLocal_1) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L79] COND TRUE (var_1_7 / var_1_13) == var_1_25 [L80] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L88] COND TRUE (var_1_11 - var_1_37) != -256 [L89] var_1_21 = ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L93] signed long int stepLocal_4 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L94] COND TRUE ((var_1_31 - var_1_32) + var_1_24) != var_1_23 [L95] var_1_30 = ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L101] COND TRUE var_1_28 < var_1_37 [L102] var_1_33 = (((26262 - var_1_11) + 18571) - var_1_38) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L122] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_0=-128, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L123] COND TRUE stepLocal_0 >= (var_1_37 * (10u * var_1_33)) [L124] var_1_1 = (var_1_10 + var_1_10) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L128] unsigned long int stepLocal_2 = 1u; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_2=1, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L129] COND FALSE !((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == stepLocal_2) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L132] COND TRUE var_1_1 <= var_1_33 [L133] var_1_15 = ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR ((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38))))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L179-L180] return (((((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38)))))) && (var_1_37 == ((unsigned short int) var_1_11))) && (var_1_38 == ((unsigned char) var_1_11))) && (var_1_39 == ((signed char) var_1_11)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=0, var_1_13=24, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2872 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2870 mSDsluCounter, 4720 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3765 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1833 IncrementalHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 955 mSDtfsCounter, 1833 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=767occurred in iteration=6, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 730 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 4652 SizeOfPredicates, 4 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 6630/6720 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:02:34,482 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-16.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 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:02:36,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:02:36,835 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:02:36,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:02:36,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:02:36,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:02:36,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:02:36,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:02:36,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:02:36,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:02:36,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:02:36,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:02:36,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:02:36,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:02:36,883 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:02:36,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:02:36,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:02:36,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:02:36,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:02:36,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:02:36,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:02:36,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:02:36,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:02:36,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:36,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:36,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:36,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:02:36,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:02:36,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:02:36,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:02:36,888 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 -> 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 [2025-01-09 13:02:37,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:02:37,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:02:37,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:02:37,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:02:37,206 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:02:37,210 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-16.i [2025-01-09 13:02:38,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d206da576/7e87744ebad8434aa62d2c7a53d0d01c/FLAG3ed1e5e3b [2025-01-09 13:02:38,870 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:02:38,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2025-01-09 13:02:38,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d206da576/7e87744ebad8434aa62d2c7a53d0d01c/FLAG3ed1e5e3b [2025-01-09 13:02:38,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d206da576/7e87744ebad8434aa62d2c7a53d0d01c [2025-01-09 13:02:38,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:02:38,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:02:38,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:38,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:02:38,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:02:38,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:38" (1/1) ... [2025-01-09 13:02:38,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7a012d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:38, skipping insertion in model container [2025-01-09 13:02:38,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:38" (1/1) ... [2025-01-09 13:02:38,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:02:39,067 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-16.i[916,929] [2025-01-09 13:02:39,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:39,165 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:02:39,175 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-16.i[916,929] [2025-01-09 13:02:39,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:39,267 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:02:39,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39 WrapperNode [2025-01-09 13:02:39,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:39,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:39,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:02:39,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:02:39,277 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:02:39" (1/1) ... [2025-01-09 13:02:39,293 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:02:39" (1/1) ... [2025-01-09 13:02:39,325 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2025-01-09 13:02:39,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:39,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:02:39,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:02:39,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:02:39,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,365 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:02:39,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:02:39,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:02:39,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:02:39,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:02:39,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (1/1) ... [2025-01-09 13:02:39,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:39,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:39,452 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:02:39,459 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:02:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:02:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:02:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:02:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:02:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:02:39,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:02:39,567 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:02:39,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:02:48,667 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 13:02:48,667 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:02:48,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:02:48,678 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:02:48,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:48 BoogieIcfgContainer [2025-01-09 13:02:48,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:02:48,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:02:48,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:02:48,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:02:48,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:02:38" (1/3) ... [2025-01-09 13:02:48,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7041619c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:48, skipping insertion in model container [2025-01-09 13:02:48,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:39" (2/3) ... [2025-01-09 13:02:48,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7041619c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:48, skipping insertion in model container [2025-01-09 13:02:48,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:48" (3/3) ... [2025-01-09 13:02:48,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-16.i [2025-01-09 13:02:48,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:02:48,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-16.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:02:48,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:02:48,784 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;@15be5236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:02:48,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:02:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:02:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:02:48,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:48,804 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:48,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2072823248, now seen corresponding path program 1 times [2025-01-09 13:02:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:02:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69162534] [2025-01-09 13:02:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:48,826 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:02:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:02:48,828 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:02:48,830 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:02:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:02:49,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:02:49,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:49,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:49,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:02:49,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 13:02:49,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:02:49,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:02:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69162534] [2025-01-09 13:02:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69162534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:02:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370792625] [2025-01-09 13:02:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:02:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:02:49,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:02:49,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:02:49,304 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:02:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:49,331 INFO L93 Difference]: Finished difference Result 144 states and 246 transitions. [2025-01-09 13:02:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:02:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2025-01-09 13:02:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:49,342 INFO L225 Difference]: With dead ends: 144 [2025-01-09 13:02:49,343 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 13:02:49,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:02:49,350 INFO L435 NwaCegarLoop]: 110 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, 110 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:02:49,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:02:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 13:02:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 13:02:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:02:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2025-01-09 13:02:49,401 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 143 [2025-01-09 13:02:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:49,402 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2025-01-09 13:02:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:02:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2025-01-09 13:02:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:02:49,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:49,405 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:49,418 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:02:49,605 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:02:49,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:49,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash -718422682, now seen corresponding path program 1 times [2025-01-09 13:02:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:02:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037490205] [2025-01-09 13:02:49,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:49,608 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:02:49,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:02:49,611 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:02:49,612 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:02:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:02:49,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:02:49,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:49,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:49,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 13:02:49,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:02:51,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:02:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:02:52,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:02:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037490205] [2025-01-09 13:02:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037490205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:02:52,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:02:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2025-01-09 13:02:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407525318] [2025-01-09 13:02:52,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:02:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:02:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:02:52,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:02:52,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:02:52,710 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 13:02:56,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:03:01,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:03:03,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:03:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:03,720 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2025-01-09 13:03:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:03:03,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 143 [2025-01-09 13:03:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:03,723 INFO L225 Difference]: With dead ends: 292 [2025-01-09 13:03:03,723 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 13:03:03,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:03:03,725 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 312 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 125 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:03,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 523 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2025-01-09 13:03:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 13:03:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2025-01-09 13:03:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 130 states have internal predecessors, (181), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 13:03:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 283 transitions. [2025-01-09 13:03:03,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 283 transitions. Word has length 143 [2025-01-09 13:03:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:03,760 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 283 transitions. [2025-01-09 13:03:03,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-01-09 13:03:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 283 transitions. [2025-01-09 13:03:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:03:03,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:03,762 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:03,776 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:03:03,963 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:03:03,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:03,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash -969915668, now seen corresponding path program 1 times [2025-01-09 13:03:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:03:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563128994] [2025-01-09 13:03:03,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:03,965 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:03:03,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:03:03,967 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:03:03,968 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:03:04,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:03:04,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:03:04,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:04,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:04,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:03:04,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:03:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:03:04,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:03:04,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:03:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563128994] [2025-01-09 13:03:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563128994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:03:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210655260] [2025-01-09 13:03:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:03:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:03:04,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:03:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:03:04,498 INFO L87 Difference]: Start difference. First operand 184 states and 283 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:03:07,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:03:10,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 13:03:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:11,335 INFO L93 Difference]: Finished difference Result 575 states and 868 transitions. [2025-01-09 13:03:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:03:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-01-09 13:03:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:11,342 INFO L225 Difference]: With dead ends: 575 [2025-01-09 13:03:11,343 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 13:03:11,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:03:11,345 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 154 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:11,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 431 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-01-09 13:03:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 13:03:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 287. [2025-01-09 13:03:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 197 states have internal predecessors, (250), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 79 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 13:03:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 416 transitions. [2025-01-09 13:03:11,412 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 416 transitions. Word has length 144 [2025-01-09 13:03:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:11,412 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 416 transitions. [2025-01-09 13:03:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:03:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 416 transitions. [2025-01-09 13:03:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:03:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:11,415 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:11,430 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 (4)] Ended with exit code 0 [2025-01-09 13:03:11,615 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:03:11,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:11,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -912657366, now seen corresponding path program 1 times [2025-01-09 13:03:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:03:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518647935] [2025-01-09 13:03:11,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:11,617 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:03:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:03:11,621 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:03:11,622 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:03:11,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:03:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:03:11,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:11,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:11,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:03:11,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:03:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:03:13,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:03:13,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:03:13,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518647935] [2025-01-09 13:03:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518647935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:03:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:03:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:03:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102112715] [2025-01-09 13:03:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:03:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:03:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:03:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:03:13,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:03:13,123 INFO L87 Difference]: Start difference. First operand 287 states and 416 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:03:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:03:20,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:03:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:03:20,767 INFO L93 Difference]: Finished difference Result 933 states and 1350 transitions. [2025-01-09 13:03:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:03:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-01-09 13:03:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:03:20,801 INFO L225 Difference]: With dead ends: 933 [2025-01-09 13:03:20,802 INFO L226 Difference]: Without dead ends: 653 [2025-01-09 13:03:20,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:03:20,803 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 204 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:03:20,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 424 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-01-09 13:03:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-01-09 13:03:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 493. [2025-01-09 13:03:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 342 states have (on average 1.3157894736842106) internal successors, (450), 347 states have internal predecessors, (450), 134 states have call successors, (134), 16 states have call predecessors, (134), 16 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 13:03:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 718 transitions. [2025-01-09 13:03:20,879 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 718 transitions. Word has length 144 [2025-01-09 13:03:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:03:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 718 transitions. [2025-01-09 13:03:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:03:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 718 transitions. [2025-01-09 13:03:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:03:20,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:03:20,885 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,897 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 (5)] Ended with exit code 0 [2025-01-09 13:03:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:03:21,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:03:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:03:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2102446252, now seen corresponding path program 1 times [2025-01-09 13:03:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:03:21,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812208091] [2025-01-09 13:03:21,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:03:21,088 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:03:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:03:21,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:03:21,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 13:03:21,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:03:21,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:03:21,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:03:21,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:03:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 13:03:21,434 INFO L279 TraceCheckSpWp]: Computing forward predicates...