./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_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_50-1loop_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 17166ae5ac8080269c2a7aa26dabdd1b745e019248f0bf33655988f8a95de676 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:38:21,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:38:21,231 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:38:21,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:38:21,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:38:21,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:38:21,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:38:21,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:38:21,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:38:21,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:38:21,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:38:21,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:38:21,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:38:21,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:38:21,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:38:21,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:38:21,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:38:21,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:38:21,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:38:21,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:38:21,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:21,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:38:21,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:38:21,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:21,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:38:21,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:38:21,270 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 -> 17166ae5ac8080269c2a7aa26dabdd1b745e019248f0bf33655988f8a95de676 [2025-01-09 13:38:21,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:38:21,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:38:21,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:38:21,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:38:21,513 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:38:21,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:22,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7257d92e2/1530237672344a6fafe11324eddb4391/FLAG1a232756d [2025-01-09 13:38:22,953 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:38:22,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:22,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7257d92e2/1530237672344a6fafe11324eddb4391/FLAG1a232756d [2025-01-09 13:38:23,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7257d92e2/1530237672344a6fafe11324eddb4391 [2025-01-09 13:38:23,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:38:23,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:38:23,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:38:23,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:38:23,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:38:23,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552c6894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23, skipping insertion in model container [2025-01-09 13:38:23,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:38:23,475 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_50-1loop_file-16.i[915,928] [2025-01-09 13:38:23,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:38:23,511 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:38:23,517 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_50-1loop_file-16.i[915,928] [2025-01-09 13:38:23,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:38:23,546 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:38:23,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23 WrapperNode [2025-01-09 13:38:23,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:38:23,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:38:23,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:38:23,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:38:23,551 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:38:23" (1/1) ... [2025-01-09 13:38:23,556 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:38:23" (1/1) ... [2025-01-09 13:38:23,572 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 13:38:23,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:38:23,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:38:23,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:38:23,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:38:23,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,582 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,602 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:38:23,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:38:23,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:38:23,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:38:23,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:38:23,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (1/1) ... [2025-01-09 13:38:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:38:23,660 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:38:23,669 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:38:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:38:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:38:23,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:38:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:38:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:38:23,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:38:23,739 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:38:23,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:38:23,975 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 13:38:23,975 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:38:23,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:38:23,981 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:38:23,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:38:23 BoogieIcfgContainer [2025-01-09 13:38:23,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:38:23,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:38:23,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:38:23,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:38:23,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:38:23" (1/3) ... [2025-01-09 13:38:23,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caffef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:38:23, skipping insertion in model container [2025-01-09 13:38:23,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:23" (2/3) ... [2025-01-09 13:38:23,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@caffef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:38:23, skipping insertion in model container [2025-01-09 13:38:23,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:38:23" (3/3) ... [2025-01-09 13:38:23,988 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:23,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:38:23,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-16.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:38:24,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:38:24,036 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;@61dc8b2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:38:24,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:38:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:38:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:38:24,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:24,046 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:24,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 864120810, now seen corresponding path program 1 times [2025-01-09 13:38:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119951269] [2025-01-09 13:38:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:38:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:38:24,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:24,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 13:38:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119951269] [2025-01-09 13:38:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119951269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:38:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642358368] [2025-01-09 13:38:24,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:24,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:38:24,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:38:24,229 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:38:24,231 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:38:24,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:38:24,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:38:24,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:24,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:24,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:38:24,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:38:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 13:38:24,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:38:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642358368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:38:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:38:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720238099] [2025-01-09 13:38:24,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:24,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:38:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:24,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:38:24,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:38:24,448 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:38:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:24,488 INFO L93 Difference]: Finished difference Result 151 states and 251 transitions. [2025-01-09 13:38:24,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:38:24,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-01-09 13:38:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:24,498 INFO L225 Difference]: With dead ends: 151 [2025-01-09 13:38:24,498 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 13:38:24,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:38:24,506 INFO L435 NwaCegarLoop]: 114 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, 114 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:38:24,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:38:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 13:38:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 13:38:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:38:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2025-01-09 13:38:24,560 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 147 [2025-01-09 13:38:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2025-01-09 13:38:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:38:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2025-01-09 13:38:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:38:24,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:24,562 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,569 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:38:24,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:38:24,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1315084494, now seen corresponding path program 1 times [2025-01-09 13:38:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390908505] [2025-01-09 13:38:24,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:24,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:38:24,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:38:24,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 13:38:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390908505] [2025-01-09 13:38:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390908505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:38:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:38:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652311216] [2025-01-09 13:38:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:25,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:38:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:25,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:38:25,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:38:25,105 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:25,244 INFO L93 Difference]: Finished difference Result 253 states and 369 transitions. [2025-01-09 13:38:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:38:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 13:38:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:25,247 INFO L225 Difference]: With dead ends: 253 [2025-01-09 13:38:25,247 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 13:38:25,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:38:25,248 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 185 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:38:25,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 416 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:38:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 13:38:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2025-01-09 13:38:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 13:38:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2025-01-09 13:38:25,259 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 147 [2025-01-09 13:38:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:25,260 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2025-01-09 13:38:25,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2025-01-09 13:38:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:38:25,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:25,261 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:38:25,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1391534900, now seen corresponding path program 1 times [2025-01-09 13:38:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261839655] [2025-01-09 13:38:25,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:25,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:38:25,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:38:25,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:25,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 13:38:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261839655] [2025-01-09 13:38:25,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261839655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:25,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:38:25,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:38:25,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756812730] [2025-01-09 13:38:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:25,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:38:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:25,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:38:25,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:38:25,546 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:25,708 INFO L93 Difference]: Finished difference Result 326 states and 476 transitions. [2025-01-09 13:38:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:38:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 13:38:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:25,710 INFO L225 Difference]: With dead ends: 326 [2025-01-09 13:38:25,710 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 13:38:25,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:38:25,711 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 216 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:38:25,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 550 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:38:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 13:38:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2025-01-09 13:38:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 148 states have internal predecessors, (208), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:38:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. [2025-01-09 13:38:25,723 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 264 transitions. Word has length 147 [2025-01-09 13:38:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:25,723 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 264 transitions. [2025-01-09 13:38:25,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2025-01-09 13:38:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:38:25,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:25,725 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:38:25,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1649700338, now seen corresponding path program 1 times [2025-01-09 13:38:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812874780] [2025-01-09 13:38:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:25,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:38:25,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:38:25,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:25,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 13:38:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812874780] [2025-01-09 13:38:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812874780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:26,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:38:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:38:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419570974] [2025-01-09 13:38:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:38:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:26,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:38:26,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:38:26,301 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:26,599 INFO L93 Difference]: Finished difference Result 456 states and 679 transitions. [2025-01-09 13:38:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:38:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-01-09 13:38:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:26,602 INFO L225 Difference]: With dead ends: 456 [2025-01-09 13:38:26,602 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 13:38:26,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:38:26,603 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 39 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:38:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 411 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:38:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 13:38:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 243. [2025-01-09 13:38:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.4619047619047618) internal successors, (307), 212 states have internal predecessors, (307), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:38:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 363 transitions. [2025-01-09 13:38:26,619 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 363 transitions. Word has length 147 [2025-01-09 13:38:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:26,620 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 363 transitions. [2025-01-09 13:38:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2025-01-09 13:38:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 13:38:26,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:26,622 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:38:26,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:26,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1014419918, now seen corresponding path program 1 times [2025-01-09 13:38:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163148900] [2025-01-09 13:38:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:26,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 13:38:26,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 13:38:26,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 13:38:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163148900] [2025-01-09 13:38:26,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163148900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:26,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:38:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:38:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978407568] [2025-01-09 13:38:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:26,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:38:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:26,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:38:26,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:38:26,887 INFO L87 Difference]: Start difference. First operand 243 states and 363 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:27,067 INFO L93 Difference]: Finished difference Result 694 states and 1023 transitions. [2025-01-09 13:38:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:38:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 13:38:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:27,072 INFO L225 Difference]: With dead ends: 694 [2025-01-09 13:38:27,072 INFO L226 Difference]: Without dead ends: 454 [2025-01-09 13:38:27,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:38:27,073 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:38:27,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:38:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-09 13:38:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 390. [2025-01-09 13:38:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 325 states have (on average 1.4246153846153846) internal successors, (463), 329 states have internal predecessors, (463), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 13:38:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 575 transitions. [2025-01-09 13:38:27,103 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 575 transitions. Word has length 148 [2025-01-09 13:38:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:27,103 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 575 transitions. [2025-01-09 13:38:27,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 13:38:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 575 transitions. [2025-01-09 13:38:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 13:38:27,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:27,105 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:38:27,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -315058803, now seen corresponding path program 1 times [2025-01-09 13:38:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:27,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139420135] [2025-01-09 13:38:27,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:27,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:38:27,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:38:27,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:27,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 13:38:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:38:27,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139420135] [2025-01-09 13:38:27,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139420135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:38:27,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894191525] [2025-01-09 13:38:27,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:38:27,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:38:27,322 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:38:27,324 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:38:27,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:38:27,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:38:27,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 13:38:27,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:38:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 13:38:27,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:38:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 13:38:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894191525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:38:27,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:38:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 13:38:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228566573] [2025-01-09 13:38:27,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:38:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:38:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:38:27,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:38:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:38:27,805 INFO L87 Difference]: Start difference. First operand 390 states and 575 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 13:38:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:28,310 INFO L93 Difference]: Finished difference Result 859 states and 1238 transitions. [2025-01-09 13:38:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 13:38:28,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 149 [2025-01-09 13:38:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:28,313 INFO L225 Difference]: With dead ends: 859 [2025-01-09 13:38:28,313 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 13:38:28,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2025-01-09 13:38:28,315 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 375 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:38:28,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 532 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:38:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 13:38:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 249. [2025-01-09 13:38:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 197 states have internal predecessors, (276), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 13:38:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 368 transitions. [2025-01-09 13:38:28,332 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 368 transitions. Word has length 149 [2025-01-09 13:38:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:28,352 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 368 transitions. [2025-01-09 13:38:28,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 13:38:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 368 transitions. [2025-01-09 13:38:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 13:38:28,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:28,353 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:28,371 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:38:28,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:38:28,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1567353739, now seen corresponding path program 1 times [2025-01-09 13:38:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:38:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62644144] [2025-01-09 13:38:28,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:38:28,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:38:28,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:38:28,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:38:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903745924] [2025-01-09 13:38:28,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:28,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:38:28,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:38:28,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:38:28,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:38:28,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:38:28,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:38:28,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:28,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:38:28,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:38:28,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:38:28,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:38:28,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:38:28,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:38:28,792 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:38:28,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:38:28,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 13:38:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:38:28,997 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:38:29,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:38:29,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:38:29 BoogieIcfgContainer [2025-01-09 13:38:29,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:38:29,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:38:29,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:38:29,093 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:38:29,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:38:23" (3/4) ... [2025-01-09 13:38:29,095 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:38:29,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:38:29,097 INFO L158 Benchmark]: Toolchain (without parser) took 5821.95ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.8MB in the beginning and 244.8MB in the end (delta: -139.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2025-01-09 13:38:29,097 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:38:29,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.54ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:38:29,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.74ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:38:29,097 INFO L158 Benchmark]: Boogie Preprocessor took 55.81ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:38:29,098 INFO L158 Benchmark]: RCFGBuilder took 352.55ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 64.3MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:38:29,099 INFO L158 Benchmark]: TraceAbstraction took 5108.44ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.5MB in the beginning and 244.9MB in the end (delta: -181.3MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-01-09 13:38:29,099 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 335.5MB. Free memory was 244.9MB in the beginning and 244.8MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:38:29,100 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.18ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.54ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.74ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 89.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.81ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 352.55ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 64.3MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5108.44ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.5MB in the beginning and 244.9MB in the end (delta: -181.3MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 335.5MB. Free memory was 244.9MB in the beginning and 244.8MB in the end (delta: 66.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned short int last_1_var_1_7 = 8; [L44] unsigned short int last_1_var_1_11 = 32; [L45] signed char last_1_var_1_14 = 32; [L46] unsigned short int last_1_var_1_23 = 128; VAL [isInitial=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L143] isInitial = 1 [L144] FCALL initially() [L145] int k_loop; [L146] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L146] COND TRUE k_loop < 1 [L147] CALL updateLastVariables() [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_11 = var_1_11 [L135] last_1_var_1_14 = var_1_14 [L136] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L147] RET updateLastVariables() [L148] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] var_1_5 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] var_1_6 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L107] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L108] var_1_10 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L109] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L110] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L115] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L115] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L119] var_1_17 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L120] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L121] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L126] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L128] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L129] var_1_22 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L130] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L148] RET updateVariables() [L149] CALL step() [L50] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_0=32, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L51] COND FALSE !((last_1_var_1_23 / -50) >= stepLocal_0) [L58] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L60] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=2] [L63] COND TRUE var_1_6 > 128 [L64] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1074756575] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1074756575] [L66] signed long int stepLocal_2 = var_1_5 | var_1_6; [L67] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < stepLocal_2) [L72] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1074756575] [L74] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_1=129, var_1_10=1074789342, var_1_11=-32769, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=-32769, var_1_9=-1074756575] [L75] COND TRUE last_1_var_1_7 < stepLocal_1 [L76] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L78] unsigned short int stepLocal_4 = var_1_8; [L79] signed long int stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_3=-1074756575, stepLocal_4=-32769, var_1_10=1074789342, var_1_11=-32769, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L80] COND FALSE !(stepLocal_3 < (- var_1_10)) [L85] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=-32769, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L87] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=-32769, stepLocal_5=-32769, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L88] COND TRUE last_1_var_1_14 <= stepLocal_5 [L89] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=-32769, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L91] COND TRUE var_1_4 || var_1_19 [L92] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=-32769, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L149] RET step() [L150] CALL, EXPR property() [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L139-L140] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1074789342, var_1_11=-32769, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=-32769, var_1_9=-1074756575] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 2449 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1745 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 995 IncrementalHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 704 mSDtfsCounter, 995 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 408 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1321 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 4 NumberOfNonLiveVariables, 716 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 8121/8316 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:38:29,126 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_50-1loop_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 17166ae5ac8080269c2a7aa26dabdd1b745e019248f0bf33655988f8a95de676 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:38:31,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:38:31,097 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:38:31,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:38:31,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:38:31,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:38:31,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:38:31,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:38:31,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:38:31,141 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:38:31,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:38:31,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:38:31,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:38:31,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:38:31,142 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:38:31,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:38:31,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:38:31,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:38:31,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:38:31,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:38:31,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:38:31,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:31,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:38:31,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:31,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:38:31,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:38:31,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:38:31,147 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 -> 17166ae5ac8080269c2a7aa26dabdd1b745e019248f0bf33655988f8a95de676 [2025-01-09 13:38:31,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:38:31,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:38:31,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:38:31,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:38:31,400 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:38:31,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:32,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2ed7ed1a/eb3ed791aa8647779866a20576752e5c/FLAGe53c5c1ee [2025-01-09 13:38:32,866 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:38:32,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:32,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2ed7ed1a/eb3ed791aa8647779866a20576752e5c/FLAGe53c5c1ee [2025-01-09 13:38:33,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2ed7ed1a/eb3ed791aa8647779866a20576752e5c [2025-01-09 13:38:33,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:38:33,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:38:33,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:38:33,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:38:33,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:38:33,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3d4c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33, skipping insertion in model container [2025-01-09 13:38:33,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:38:33,307 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_50-1loop_file-16.i[915,928] [2025-01-09 13:38:33,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:38:33,388 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:38:33,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-16.i[915,928] [2025-01-09 13:38:33,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:38:33,428 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:38:33,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33 WrapperNode [2025-01-09 13:38:33,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:38:33,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:38:33,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:38:33,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:38:33,437 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:38:33" (1/1) ... [2025-01-09 13:38:33,450 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:38:33" (1/1) ... [2025-01-09 13:38:33,467 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-01-09 13:38:33,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:38:33,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:38:33,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:38:33,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:38:33,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,491 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:38:33,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:38:33,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:38:33,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:38:33,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:38:33,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (1/1) ... [2025-01-09 13:38:33,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:38:33,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:38:33,531 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:38:33,534 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:38:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:38:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:38:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:38:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:38:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:38:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:38:33,638 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:38:33,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:38:36,303 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 13:38:36,303 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:38:36,320 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:38:36,320 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:38:36,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:38:36 BoogieIcfgContainer [2025-01-09 13:38:36,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:38:36,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:38:36,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:38:36,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:38:36,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:38:33" (1/3) ... [2025-01-09 13:38:36,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aaa9674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:38:36, skipping insertion in model container [2025-01-09 13:38:36,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:38:33" (2/3) ... [2025-01-09 13:38:36,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aaa9674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:38:36, skipping insertion in model container [2025-01-09 13:38:36,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:38:36" (3/3) ... [2025-01-09 13:38:36,336 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-16.i [2025-01-09 13:38:36,349 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:38:36,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-16.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:38:36,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:38:36,409 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;@42af8539, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:38:36,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:38:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:38:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:38:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:36,424 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:36,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash 113026205, now seen corresponding path program 1 times [2025-01-09 13:38:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:38:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920496916] [2025-01-09 13:38:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:36,440 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:38:36,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:38:36,443 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:38:36,445 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:38:36,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:38:36,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:38:36,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:36,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:36,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:38:36,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:38:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 13:38:36,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:38:36,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:38:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920496916] [2025-01-09 13:38:36,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920496916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:38:36,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:38:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:38:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146990042] [2025-01-09 13:38:36,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:38:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:38:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:38:36,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:38:36,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:38:36,844 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:38:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:38:36,860 INFO L93 Difference]: Finished difference Result 133 states and 223 transitions. [2025-01-09 13:38:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:38:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-01-09 13:38:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:38:36,865 INFO L225 Difference]: With dead ends: 133 [2025-01-09 13:38:36,865 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 13:38:36,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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:38:36,868 INFO L435 NwaCegarLoop]: 100 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, 100 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:38:36,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:38:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 13:38:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 13:38:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 13:38:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2025-01-09 13:38:36,897 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 144 [2025-01-09 13:38:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:38:36,897 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2025-01-09 13:38:36,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 13:38:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2025-01-09 13:38:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:38:36,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:38:36,900 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,910 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:38:37,100 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:38:37,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:38:37,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:38:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash 655176277, now seen corresponding path program 1 times [2025-01-09 13:38:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:38:37,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511761955] [2025-01-09 13:38:37,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:38:37,103 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:38:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:38:37,105 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:38:37,107 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:38:37,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:38:37,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:38:37,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:38:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:38:37,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 13:38:37,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:39:20,395 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)