./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:11:20,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:11:20,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:11:20,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:11:20,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:11:20,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:11:20,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:11:20,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:11:20,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:11:20,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:11:20,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:11:20,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:11:20,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:11:20,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:11:20,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:11:20,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:11:20,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:11:20,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:20,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:11:20,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:11:20,491 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/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 -> 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 [2025-03-03 23:11:20,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:11:20,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:11:20,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:11:20,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:11:20,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:11:20,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:21,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148a60b88/4ac81d400edc471ab48bc227899e3f3f/FLAG0ed893cc8 [2025-03-03 23:11:22,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:11:22,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:22,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148a60b88/4ac81d400edc471ab48bc227899e3f3f/FLAG0ed893cc8 [2025-03-03 23:11:22,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148a60b88/4ac81d400edc471ab48bc227899e3f3f [2025-03-03 23:11:22,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:11:22,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:11:22,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:22,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:11:22,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:11:22,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22, skipping insertion in model container [2025-03-03 23:11:22,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:11:22,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-03 23:11:22,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:22,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:11:22,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-03 23:11:22,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:22,683 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:11:22,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22 WrapperNode [2025-03-03 23:11:22,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:22,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:22,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:11:22,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:11:22,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,722 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-03 23:11:22,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:22,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:11:22,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:11:22,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:11:22,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,754 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-03-03 23:11:22,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:11:22,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:11:22,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:11:22,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:11:22,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (1/1) ... [2025-03-03 23:11:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:22,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:11:22,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:11:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:11:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:11:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:11:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:11:22,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:11:22,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:11:22,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:11:22,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:11:23,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc property_#t~ite13#1;havoc property_#t~bitwise12#1;havoc property_#t~short14#1; [2025-03-03 23:11:23,097 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 23:11:23,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:11:23,117 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:11:23,117 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:11:23,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:23 BoogieIcfgContainer [2025-03-03 23:11:23,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:11:23,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:11:23,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:11:23,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:11:23,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:11:22" (1/3) ... [2025-03-03 23:11:23,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f54863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:23, skipping insertion in model container [2025-03-03 23:11:23,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:22" (2/3) ... [2025-03-03 23:11:23,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f54863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:23, skipping insertion in model container [2025-03-03 23:11:23,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:23" (3/3) ... [2025-03-03 23:11:23,128 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:23,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:11:23,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:11:23,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:11:23,189 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;@6b172ce6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:11:23,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:11:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:11:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 23:11:23,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:23,201 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:23,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1681362347, now seen corresponding path program 1 times [2025-03-03 23:11:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:11:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221367771] [2025-03-03 23:11:23,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:11:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 23:11:23,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 23:11:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 23:11:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:11:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221367771] [2025-03-03 23:11:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221367771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:11:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905462552] [2025-03-03 23:11:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:23,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:11:23,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:23,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:11:23,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:11:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 23:11:23,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 23:11:23,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:23,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:23,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:11:23,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 23:11:23,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:11:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905462552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:11:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:11:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:11:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895289494] [2025-03-03 23:11:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:11:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:11:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:11:23,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:11:23,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:23,522 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:11:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:23,545 INFO L93 Difference]: Finished difference Result 103 states and 161 transitions. [2025-03-03 23:11:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:11:23,548 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-03 23:11:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:23,552 INFO L225 Difference]: With dead ends: 103 [2025-03-03 23:11:23,552 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 23:11:23,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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-03-03 23:11:23,558 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:11:23,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:11:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 23:11:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 23:11:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:11:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-03 23:11:23,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 83 [2025-03-03 23:11:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-03 23:11:23,587 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:11:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-03 23:11:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 23:11:23,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:23,589 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:23,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:11:23,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:11:23,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash -534214413, now seen corresponding path program 1 times [2025-03-03 23:11:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:11:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479997064] [2025-03-03 23:11:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:11:23,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 23:11:23,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 23:11:23,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:23,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:11:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:11:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479997064] [2025-03-03 23:11:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479997064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:11:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822698684] [2025-03-03 23:11:24,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:24,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:11:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:24,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:11:24,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:11:24,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 23:11:24,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 23:11:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:24,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:11:24,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 23:11:24,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:11:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:11:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822698684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:11:24,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:11:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:11:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316161894] [2025-03-03 23:11:24,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:11:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:11:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:11:24,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:11:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:11:24,402 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:11:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:24,566 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2025-03-03 23:11:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:11:24,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 83 [2025-03-03 23:11:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:24,569 INFO L225 Difference]: With dead ends: 117 [2025-03-03 23:11:24,569 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:11:24,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:11:24,570 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 78 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:11:24,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 163 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:11:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:11:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-03 23:11:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:11:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-03-03 23:11:24,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 83 [2025-03-03 23:11:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-03-03 23:11:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:11:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-03-03 23:11:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 23:11:24,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:24,585 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:24,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:11:24,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 23:11:24,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:24,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1559543291, now seen corresponding path program 1 times [2025-03-03 23:11:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:11:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817186956] [2025-03-03 23:11:24,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:11:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 23:11:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 23:11:24,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:24,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:11:24,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:11:24,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 23:11:24,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 23:11:24,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:24,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:11:24,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:11:24,885 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:11:24,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:11:24,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:11:24,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:11:24,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:11:24,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:11:24 BoogieIcfgContainer [2025-03-03 23:11:24,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:11:24,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:11:24,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:11:24,937 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:11:24,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:23" (3/4) ... [2025-03-03 23:11:24,940 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:11:24,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:11:24,941 INFO L158 Benchmark]: Toolchain (without parser) took 2462.28ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 89.7MB in the end (delta: 23.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2025-03-03 23:11:24,942 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:24,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.47ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 100.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:11:24,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:11:24,942 INFO L158 Benchmark]: Boogie Preprocessor took 44.40ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:24,942 INFO L158 Benchmark]: IcfgBuilder took 346.31ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 75.4MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:11:24,943 INFO L158 Benchmark]: TraceAbstraction took 1815.40ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 89.7MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:24,943 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:11:24,944 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.47ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 100.9MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.40ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 346.31ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 75.4MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1815.40ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 89.7MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 128.6; [L24] float var_1_3 = 49.4; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 8; [L29] unsigned char var_1_8 = 128; [L30] unsigned char var_1_9 = 64; [L31] signed short int var_1_10 = 5; VAL [isInitial=0, var_1_10=5, var_1_1=0, var_1_2=643/5, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L88] isInitial = 1 [L89] FCALL initially() [L90] int k_loop; [L91] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=5, var_1_1=0, var_1_2=643/5, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L91] COND TRUE k_loop < 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L62] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_3=247/5, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=8, var_1_8=128, var_1_9=64] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L72] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=128, var_1_9=64] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L76] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=64] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682] [L79] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L79] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L93] RET updateVariables() [L94] CALL step() [L35] COND TRUE var_1_2 < var_1_3 [L36] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L44] COND TRUE \read(var_1_6) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8, var_1_8=-7682, var_1_9=31] [L45] COND TRUE var_1_3 != 15.8f [L46] var_1_7 = (var_1_8 - var_1_9) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L53] EXPR (var_1_9 / 32) << var_1_8 VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L53] signed long int stepLocal_0 = (var_1_9 / 32) << var_1_8; [L54] COND FALSE !(! (var_1_3 < var_1_2)) VAL [isInitial=1, stepLocal_0=0, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L94] RET step() [L95] CALL, EXPR property() [L84] EXPR (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L84-L85] return (((var_1_2 < var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : ((var_1_3 >= var_1_2) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_6)))) && (var_1_6 ? ((var_1_3 != 15.8f) ? (var_1_7 == ((unsigned char) (var_1_8 - var_1_9))) : (var_1_7 == ((unsigned char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9)))))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((! (var_1_3 < var_1_2)) ? ((((var_1_9 / 32) << var_1_8) == var_1_7) ? (var_1_10 == ((signed short int) (var_1_7 - var_1_8))) : 1) : 1) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=223, var_1_8=-7682, var_1_9=31] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 138 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1253/1320 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-03-03 23:11:24,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:11:26,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:11:26,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:11:26,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:11:26,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:11:26,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:11:26,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:11:26,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:11:26,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:11:26,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:11:26,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:11:26,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:11:26,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:11:26,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:11:26,810 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:11:26,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:11:26,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:26,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:11:26,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:11:26,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:11:26,812 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/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 -> 317e245cce74eed7803564fb6a0f2b3d37b179d0249fa4ec085167b7c54282b4 [2025-03-03 23:11:27,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:11:27,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:11:27,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:11:27,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:11:27,050 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:11:27,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:28,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef38b9551/8c33107c1f5a446e974420848f10a9e0/FLAG81d797087 [2025-03-03 23:11:28,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:11:28,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:28,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef38b9551/8c33107c1f5a446e974420848f10a9e0/FLAG81d797087 [2025-03-03 23:11:28,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef38b9551/8c33107c1f5a446e974420848f10a9e0 [2025-03-03 23:11:28,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:11:28,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:11:28,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:28,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:11:28,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:11:28,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5e1018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28, skipping insertion in model container [2025-03-03 23:11:28,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:11:28,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-03 23:11:28,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:28,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:11:28,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-61.i[915,928] [2025-03-03 23:11:28,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:11:28,949 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:11:28,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28 WrapperNode [2025-03-03 23:11:28,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:11:28,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:28,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:11:28,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:11:28,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,975 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-03 23:11:28,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:11:28,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:11:28,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:11:28,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:11:28,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,990 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-03-03 23:11:28,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:28,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:11:29,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:11:29,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:11:29,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:11:29,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (1/1) ... [2025-03-03 23:11:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:11:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:11:29,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:11:29,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:11:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:11:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:11:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:11:29,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:11:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:11:29,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:11:29,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:11:29,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:11:29,311 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:11:29,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:11:29,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:11:29,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:11:29,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:29 BoogieIcfgContainer [2025-03-03 23:11:29,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:11:29,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:11:29,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:11:29,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:11:29,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:11:28" (1/3) ... [2025-03-03 23:11:29,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233c6bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:29, skipping insertion in model container [2025-03-03 23:11:29,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:11:28" (2/3) ... [2025-03-03 23:11:29,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233c6bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:11:29, skipping insertion in model container [2025-03-03 23:11:29,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:11:29" (3/3) ... [2025-03-03 23:11:29,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i [2025-03-03 23:11:29,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:11:29,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-61.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:11:29,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:11:29,378 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;@140dc4c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:11:29,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:11:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:11:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 23:11:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:29,386 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:29,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash -92332162, now seen corresponding path program 1 times [2025-03-03 23:11:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:11:29,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274185208] [2025-03-03 23:11:29,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:29,397 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-03-03 23:11:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:11:29,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 23:11:29,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:11:29,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 23:11:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 23:11:29,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:29,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:29,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:11:29,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 23:11:29,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:11:29,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:11:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274185208] [2025-03-03 23:11:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274185208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:11:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:11:29,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:11:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401510096] [2025-03-03 23:11:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:11:29,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:11:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:11:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:11:29,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:11:29,596 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:11:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:29,615 INFO L93 Difference]: Finished difference Result 85 states and 135 transitions. [2025-03-03 23:11:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:11:29,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-03 23:11:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:29,622 INFO L225 Difference]: With dead ends: 85 [2025-03-03 23:11:29,623 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 23:11:29,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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-03-03 23:11:29,628 INFO L435 NwaCegarLoop]: 61 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, 61 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-03-03 23:11:29,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:11:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 23:11:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 23:11:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 23:11:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-03 23:11:29,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 80 [2025-03-03 23:11:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:29,660 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-03 23:11:29,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 23:11:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-03 23:11:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 23:11:29,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:29,664 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:29,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:11:29,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:11:29,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:29,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2126626208, now seen corresponding path program 1 times [2025-03-03 23:11:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:11:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079279845] [2025-03-03 23:11:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:29,866 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-03-03 23:11:29,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:11:29,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 23:11:29,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:11:29,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 23:11:30,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 23:11:30,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:30,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:30,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:11:30,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 23:11:30,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:11:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:11:30,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:11:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079279845] [2025-03-03 23:11:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079279845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:11:30,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:11:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 23:11:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806594042] [2025-03-03 23:11:30,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:11:30,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:11:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:11:30,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:11:30,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:11:30,251 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:11:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:11:30,458 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2025-03-03 23:11:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:11:30,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 80 [2025-03-03 23:11:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:11:30,460 INFO L225 Difference]: With dead ends: 99 [2025-03-03 23:11:30,460 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 23:11:30,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:11:30,461 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:11:30,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 140 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:11:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 23:11:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-03-03 23:11:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:11:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-03-03 23:11:30,469 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 80 [2025-03-03 23:11:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:11:30,469 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-03-03 23:11:30,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:11:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-03-03 23:11:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 23:11:30,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:11:30,471 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:11:30,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:11:30,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:11:30,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:11:30,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:11:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -131365496, now seen corresponding path program 1 times [2025-03-03 23:11:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:11:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917367916] [2025-03-03 23:11:30,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:11:30,675 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-03-03 23:11:30,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:11:30,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 23:11:30,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:11:30,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 23:11:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 23:11:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:11:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:11:30,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:11:30,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:11:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 23:11:31,177 INFO L312 TraceCheckSpWp]: Computing backward predicates...