./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.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_25-1loop_file-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:24:42,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:24:42,672 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:24:42,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:24:42,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:24:42,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:24:42,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:24:42,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:24:42,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:24:42,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:24:42,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:24:42,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:24:42,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:24:42,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:24:42,696 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:24:42,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:24:42,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:24:42,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:24:42,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:24:42,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:24:42,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:42,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:42,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:42,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:24:42,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:24:42,699 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 -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2025-01-09 13:24:42,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:24:42,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:24:42,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:24:42,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:24:42,938 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:24:42,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:44,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1174a97/e2b441e13a794c35ad14b17d366934eb/FLAGf56bd9132 [2025-01-09 13:24:44,352 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:24:44,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:44,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1174a97/e2b441e13a794c35ad14b17d366934eb/FLAGf56bd9132 [2025-01-09 13:24:44,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e1174a97/e2b441e13a794c35ad14b17d366934eb [2025-01-09 13:24:44,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:24:44,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:24:44,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:44,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:24:44,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:24:44,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726d7d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44, skipping insertion in model container [2025-01-09 13:24:44,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:24:44,487 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_25-1loop_file-97.i[915,928] [2025-01-09 13:24:44,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:44,534 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:24:44,543 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_25-1loop_file-97.i[915,928] [2025-01-09 13:24:44,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:44,575 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:24:44,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44 WrapperNode [2025-01-09 13:24:44,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:44,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:44,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:24:44,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:24:44,582 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:24:44" (1/1) ... [2025-01-09 13:24:44,591 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:24:44" (1/1) ... [2025-01-09 13:24:44,613 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-01-09 13:24:44,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:44,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:24:44,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:24:44,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:24:44,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,642 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:24:44,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:24:44,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:24:44,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:24:44,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:24:44,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (1/1) ... [2025-01-09 13:24:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:44,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:44,686 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:24:44,688 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:24:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:24:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:24:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:24:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:24:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:24:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:24:44,785 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:24:44,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:24:44,938 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:24:44,938 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:24:44,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:24:44,944 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:24:44,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:44 BoogieIcfgContainer [2025-01-09 13:24:44,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:24:44,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:24:44,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:24:44,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:24:44,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:24:44" (1/3) ... [2025-01-09 13:24:44,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131760e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:44, skipping insertion in model container [2025-01-09 13:24:44,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:44" (2/3) ... [2025-01-09 13:24:44,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131760e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:44, skipping insertion in model container [2025-01-09 13:24:44,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:44" (3/3) ... [2025-01-09 13:24:44,952 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:44,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:24:44,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:24:45,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:24:45,016 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40c7c2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:24:45,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:24:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:24:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 13:24:45,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:45,030 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 898852039, now seen corresponding path program 1 times [2025-01-09 13:24:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168456365] [2025-01-09 13:24:45,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:45,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 13:24:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 13:24:45,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:45,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:24:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:24:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168456365] [2025-01-09 13:24:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168456365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:24:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580064331] [2025-01-09 13:24:45,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:24:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:45,188 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:24:45,191 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:24:45,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 13:24:45,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 13:24:45,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:45,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:45,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:24:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:24:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 13:24:45,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:24:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580064331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:24:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:24:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:24:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981087562] [2025-01-09 13:24:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:24:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:24:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:24:45,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:24:45,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:24:45,327 INFO L87 Difference]: Start difference. First operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:24:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:24:45,342 INFO L93 Difference]: Finished difference Result 116 states and 189 transitions. [2025-01-09 13:24:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:24:45,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-01-09 13:24:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:24:45,347 INFO L225 Difference]: With dead ends: 116 [2025-01-09 13:24:45,347 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 13:24:45,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:24:45,350 INFO L435 NwaCegarLoop]: 84 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, 84 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:24:45,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:24:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 13:24:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 13:24:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:24:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-01-09 13:24:45,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 103 [2025-01-09 13:24:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:24:45,376 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-01-09 13:24:45,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 13:24:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-01-09 13:24:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 13:24:45,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:45,378 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,384 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:24:45,578 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:24:45,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1851588981, now seen corresponding path program 1 times [2025-01-09 13:24:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516456103] [2025-01-09 13:24:45,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:45,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 13:24:45,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 13:24:45,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:24:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:24:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516456103] [2025-01-09 13:24:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516456103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:24:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:24:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:24:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78075604] [2025-01-09 13:24:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:24:45,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:24:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:24:45,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:24:45,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:24:45,904 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:24:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:24:45,940 INFO L93 Difference]: Finished difference Result 131 states and 190 transitions. [2025-01-09 13:24:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:24:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-01-09 13:24:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:24:45,941 INFO L225 Difference]: With dead ends: 131 [2025-01-09 13:24:45,942 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 13:24:45,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:24:45,942 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:24:45,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:24:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 13:24:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-01-09 13:24:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:24:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-01-09 13:24:45,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 103 [2025-01-09 13:24:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:24:45,950 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-01-09 13:24:45,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:24:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-01-09 13:24:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 13:24:45,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:45,951 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:24:45,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:45,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash -448832835, now seen corresponding path program 1 times [2025-01-09 13:24:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:45,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408412437] [2025-01-09 13:24:45,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 13:24:45,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 13:24:45,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 13:24:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:24:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408412437] [2025-01-09 13:24:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408412437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:24:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:24:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:24:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504354346] [2025-01-09 13:24:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:24:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:24:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:24:46,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:24:46,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:24:46,162 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:24:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:24:46,250 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2025-01-09 13:24:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:24:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-01-09 13:24:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:24:46,254 INFO L225 Difference]: With dead ends: 141 [2025-01-09 13:24:46,254 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 13:24:46,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:24:46,255 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:24:46,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:24:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 13:24:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2025-01-09 13:24:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:24:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-01-09 13:24:46,262 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 104 [2025-01-09 13:24:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:24:46,262 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-01-09 13:24:46,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 13:24:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-01-09 13:24:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 13:24:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:46,267 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:46,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:24:46,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 82301958, now seen corresponding path program 1 times [2025-01-09 13:24:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769272503] [2025-01-09 13:24:46,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:24:46,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:24:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:24:46,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:24:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 13:24:46,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 13:24:46,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:46,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:24:46,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:24:46,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:24:46,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:24:46,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:24:46,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 13:24:46,493 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:24:46,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:24:46 BoogieIcfgContainer [2025-01-09 13:24:46,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:24:46,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:24:46,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:24:46,499 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:24:46,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:44" (3/4) ... [2025-01-09 13:24:46,502 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:24:46,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:24:46,503 INFO L158 Benchmark]: Toolchain (without parser) took 2132.60ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 128.5MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:46,503 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:46,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 120.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:24:46,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:24:46,504 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:46,504 INFO L158 Benchmark]: RCFGBuilder took 290.43ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 101.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:24:46,504 INFO L158 Benchmark]: TraceAbstraction took 1553.03ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 128.6MB in the end (delta: -27.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-01-09 13:24:46,504 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 128.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:46,505 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.19ms. Allocated memory is still 226.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.58ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 120.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 118.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.43ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 101.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1553.03ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 128.6MB in the end (delta: -27.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 128.5MB in the end (delta: 41.6kB). 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 85, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed short int var_1_7 = 32; [L26] signed short int var_1_8 = 20113; [L27] signed short int var_1_9 = 100; [L28] signed char var_1_10 = 100; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 16; [L31] float var_1_13 = 1.2; [L32] float var_1_14 = 3.6; [L33] float var_1_15 = 5.5; [L34] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L100] COND TRUE k_loop < 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L66] var_1_6 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L67] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L69] var_1_7 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L70] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L73] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L79] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L81] var_1_12 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L82] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L84] var_1_14 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L86] var_1_15 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L102] RET updateVariables() [L103] CALL step() [L38] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L49] COND TRUE var_1_1 == var_1_7 [L50] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L56] COND TRUE \read(var_1_6) [L57] var_1_13 = ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L103] RET step() [L104] CALL, EXPR property() [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93-L94] return ((var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1))) && (var_1_6 ? (var_1_13 == ((float) ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))))) : (var_1_13 == ((float) (var_1_14 - var_1_15)))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 581 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 265 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1890/1920 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:24:46,522 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_25-1loop_file-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:24:48,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:24:48,573 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:24:48,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:24:48,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:24:48,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:24:48,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:24:48,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:24:48,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:24:48,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:24:48,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:24:48,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:24:48,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:24:48,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:24:48,607 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:24:48,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:24:48,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:24:48,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:24:48,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:24:48,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:24:48,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:48,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:48,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:48,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:48,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:24:48,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:48,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:24:48,610 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:24:48,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:24:48,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:24:48,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:24:48,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:24:48,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:24:48,611 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 -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2025-01-09 13:24:48,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:24:48,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:24:48,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:24:48,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:24:48,848 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:24:48,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:50,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cde60fa3/3f718bb69a7147bfb306489ac809bc0a/FLAG877dbb39a [2025-01-09 13:24:50,296 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:24:50,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:50,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cde60fa3/3f718bb69a7147bfb306489ac809bc0a/FLAG877dbb39a [2025-01-09 13:24:50,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cde60fa3/3f718bb69a7147bfb306489ac809bc0a [2025-01-09 13:24:50,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:24:50,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:24:50,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:50,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:24:50,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:24:50,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201aeb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50, skipping insertion in model container [2025-01-09 13:24:50,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:24:50,787 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_25-1loop_file-97.i[915,928] [2025-01-09 13:24:50,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:50,844 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:24:50,855 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_25-1loop_file-97.i[915,928] [2025-01-09 13:24:50,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:50,889 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:24:50,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50 WrapperNode [2025-01-09 13:24:50,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:50,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:50,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:24:50,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:24:50,897 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:24:50" (1/1) ... [2025-01-09 13:24:50,908 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:24:50" (1/1) ... [2025-01-09 13:24:50,928 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-01-09 13:24:50,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:50,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:24:50,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:24:50,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:24:50,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,948 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:24:50,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:24:50,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:24:50,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:24:50,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:24:50,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (1/1) ... [2025-01-09 13:24:50,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:50,985 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:24:50,987 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:24:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:24:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:24:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:24:51,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:24:51,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:24:51,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:24:51,047 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:24:51,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:24:51,439 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:24:51,440 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:24:51,446 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:24:51,446 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:24:51,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:51 BoogieIcfgContainer [2025-01-09 13:24:51,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:24:51,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:24:51,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:24:51,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:24:51,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:24:50" (1/3) ... [2025-01-09 13:24:51,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13389331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:51, skipping insertion in model container [2025-01-09 13:24:51,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:50" (2/3) ... [2025-01-09 13:24:51,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13389331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:51, skipping insertion in model container [2025-01-09 13:24:51,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:51" (3/3) ... [2025-01-09 13:24:51,455 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-01-09 13:24:51,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:24:51,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:24:51,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:24:51,514 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;@103b1a04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:24:51,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:24:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 13:24:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 13:24:51,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:51,523 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:51,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1890526776, now seen corresponding path program 1 times [2025-01-09 13:24:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:24:51,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349677502] [2025-01-09 13:24:51,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:51,534 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:24:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:24:51,536 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:24:51,538 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:24:51,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 13:24:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 13:24:51,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:51,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:51,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 13:24:51,731 INFO L279 TraceCheckSpWp]: Computing forward predicates...