./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.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-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:09:05,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:09:05,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:09:05,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:09:06,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:09:06,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:09:06,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:09:06,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:09:06,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:09:06,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:09:06,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:09:06,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:09:06,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:09:06,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:09:06,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:09:06,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:09:06,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:09:06,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:09:06,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:06,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:09:06,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:09:06,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:09:06,025 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2025-03-03 23:09:06,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:09:06,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:09:06,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:09:06,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:09:06,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:09:06,279 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-40.i [2025-03-03 23:09:07,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca39a914/a6aed869fcbd4daab5779ec9ce29b49c/FLAG7e8b19bac [2025-03-03 23:09:07,601 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:09:07,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-03-03 23:09:07,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca39a914/a6aed869fcbd4daab5779ec9ce29b49c/FLAG7e8b19bac [2025-03-03 23:09:07,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca39a914/a6aed869fcbd4daab5779ec9ce29b49c [2025-03-03 23:09:07,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:09:07,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:09:07,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:07,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:09:07,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:09:07,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e64bbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07, skipping insertion in model container [2025-03-03 23:09:07,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:09:07,721 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-40.i[915,928] [2025-03-03 23:09:07,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:07,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:09:07,769 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-40.i[915,928] [2025-03-03 23:09:07,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:07,795 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:09:07,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07 WrapperNode [2025-03-03 23:09:07,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:07,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:07,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:09:07,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:09:07,803 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:09:07" (1/1) ... [2025-03-03 23:09:07,807 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:09:07" (1/1) ... [2025-03-03 23:09:07,820 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-03 23:09:07,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:07,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:09:07,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:09:07,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:09:07,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,836 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:09:07,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:09:07,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:09:07,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:09:07,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:09:07,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (1/1) ... [2025-03-03 23:09:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:07,867 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:09:07,872 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:09:07,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:09:07,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:09:07,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:09:07,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:09:07,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:09:07,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:09:07,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:09:07,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:09:08,135 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:09:08,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:09:08,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:09:08,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:09:08,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:08 BoogieIcfgContainer [2025-03-03 23:09:08,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:09:08,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:09:08,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:09:08,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:09:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:07" (1/3) ... [2025-03-03 23:09:08,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc62a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:08, skipping insertion in model container [2025-03-03 23:09:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:07" (2/3) ... [2025-03-03 23:09:08,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adc62a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:08, skipping insertion in model container [2025-03-03 23:09:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:08" (3/3) ... [2025-03-03 23:09:08,148 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-03-03 23:09:08,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:09:08,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:09:08,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:09:08,207 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;@12e82344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:09:08,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:09:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:08,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:08,218 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-03-03 23:09:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058967376] [2025-03-03 23:09:08,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:08,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:08,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:08,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 23:09:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058967376] [2025-03-03 23:09:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058967376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:09:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70187720] [2025-03-03 23:09:08,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:09:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:08,447 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:09:08,449 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:09:08,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:08,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:08,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:09:08,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 23:09:08,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70187720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:09:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:09:08,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535951321] [2025-03-03 23:09:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:08,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:09:08,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:09:08,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:09:08,618 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:09:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:08,638 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2025-03-03 23:09:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:09:08,639 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-03 23:09:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:08,645 INFO L225 Difference]: With dead ends: 95 [2025-03-03 23:09:08,646 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:09:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:09:08,652 INFO L435 NwaCegarLoop]: 69 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, 69 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:09:08,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:09:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:09:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-03-03 23:09:08,686 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-03-03 23:09:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-03 23:09:08,687 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:09:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-03-03 23:09:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:08,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:08,691 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:09:08,891 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:09:08,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-03-03 23:09:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642656135] [2025-03-03 23:09:08,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:08,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:08,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:08,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:09:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642656135] [2025-03-03 23:09:09,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642656135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:09,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:09:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860143136] [2025-03-03 23:09:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:09,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:09:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:09,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:09:09,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:09:09,090 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:09:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:09,128 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-03-03 23:09:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:09:09,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-03 23:09:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:09,130 INFO L225 Difference]: With dead ends: 99 [2025-03-03 23:09:09,130 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 23:09:09,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:09:09,131 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:09,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 23:09:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-03 23:09:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-03 23:09:09,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-03-03 23:09:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-03 23:09:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:09:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-03 23:09:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:09,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:09,142 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:09,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:09:09,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:09,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-03-03 23:09:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957053438] [2025-03-03 23:09:09,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:09,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:09,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:09,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:09,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:09:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791162537] [2025-03-03 23:09:09,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:09:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:09,258 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:09:09,260 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:09:09,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:09:09,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:09:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:09,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:09:09,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:09:09,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:09:09,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:09:09,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:09:09,660 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,SelfDestructingSolverStorable2 [2025-03-03 23:09:09,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:09:09,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:09:09,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:09:09 BoogieIcfgContainer [2025-03-03 23:09:09,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:09:09,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:09:09,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:09:09,712 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:09:09,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:08" (3/4) ... [2025-03-03 23:09:09,714 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:09:09,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:09:09,715 INFO L158 Benchmark]: Toolchain (without parser) took 2094.77ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 66.5MB in the end (delta: 46.3MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.08ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.37ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: Boogie Preprocessor took 20.80ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: IcfgBuilder took 300.03ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 81.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: TraceAbstraction took 1568.09ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 67.3MB in the end (delta: 13.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2025-03-03 23:09:09,716 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:09,718 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.08ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.37ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.80ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.03ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 81.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1568.09ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 67.3MB in the end (delta: 13.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 27.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 78, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed short int var_1_7 = 5; [L26] unsigned long int var_1_9 = 256; [L27] signed char var_1_10 = 10; [L28] signed char var_1_11 = 4; [L29] float var_1_12 = 32.4; [L30] float var_1_13 = 1.2; [L31] float var_1_14 = 64.8; [L32] float var_1_15 = 127.3; [L33] float var_1_16 = 4.02; [L34] signed char var_1_17 = -32; [L35] unsigned long int last_1_var_1_9 = 256; VAL [isInitial=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L95] COND TRUE k_loop < 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L62] var_1_3 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L63] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L64] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L65] var_1_7 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L66] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L67] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L67] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L69] var_1_10 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L70] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L71] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L71] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L72] var_1_11 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L74] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L76] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L78] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L80] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=256] [L97] RET updateVariables() [L98] CALL step() [L39] COND TRUE (var_1_10 - var_1_11) >= last_1_var_1_9 [L40] var_1_9 = (var_1_11 + 2u) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L42] COND FALSE !(\read(var_1_2)) [L45] var_1_12 = ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L47] var_1_17 = -4 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L48] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((var_1_2 ? ((var_1_3 && (var_1_12 <= (- 63.9f))) ? ((var_1_12 >= var_1_12) ? (((var_1_9 / var_1_7) <= var_1_9) ? (var_1_1 == ((signed long int) var_1_9)) : 1) : 1) : 1) : 1) && (((var_1_10 - var_1_11) >= last_1_var_1_9) ? (var_1_9 == ((unsigned long int) (var_1_11 + 2u))) : 1)) && (var_1_2 ? (var_1_12 == ((float) ((((((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) < (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? (((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) : (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))))))) : (var_1_12 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))))) && (var_1_17 == ((signed char) -4)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 141 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1232/1260 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:09:09,731 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-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:09:11,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:09:11,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:09:11,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:09:11,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:09:11,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:09:11,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:09:11,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:09:11,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:09:11,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:09:11,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:09:11,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:09:11,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:09:11,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:09:11,647 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:09:11,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:09:11,648 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:09:11,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:09:11,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:11,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:09:11,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:09:11,650 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2025-03-03 23:09:11,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:09:11,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:09:11,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:09:11,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:09:11,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:09:11,910 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-40.i [2025-03-03 23:09:13,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d9b0211/b301f960dc794c5183be45d1e4e9993a/FLAGef4bde52c [2025-03-03 23:09:13,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:09:13,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-03-03 23:09:13,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d9b0211/b301f960dc794c5183be45d1e4e9993a/FLAGef4bde52c [2025-03-03 23:09:13,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d9b0211/b301f960dc794c5183be45d1e4e9993a [2025-03-03 23:09:13,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:09:13,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:09:13,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:13,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:09:13,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:09:13,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2052aaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13, skipping insertion in model container [2025-03-03 23:09:13,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:09:13,737 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-40.i[915,928] [2025-03-03 23:09:13,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:13,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:09:13,782 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-40.i[915,928] [2025-03-03 23:09:13,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:13,809 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:09:13,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13 WrapperNode [2025-03-03 23:09:13,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:13,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:13,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:09:13,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:09:13,815 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:09:13" (1/1) ... [2025-03-03 23:09:13,821 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:09:13" (1/1) ... [2025-03-03 23:09:13,834 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-03 23:09:13,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:13,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:09:13,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:09:13,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:09:13,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,861 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:09:13,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:09:13,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:09:13,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:09:13,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:09:13,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (1/1) ... [2025-03-03 23:09:13,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:13,909 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:09:13,912 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:09:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:09:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:09:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:09:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:09:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:09:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:09:13,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:09:13,976 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:09:14,400 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:09:14,400 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:09:14,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:09:14,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:09:14,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:14 BoogieIcfgContainer [2025-03-03 23:09:14,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:09:14,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:09:14,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:09:14,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:09:14,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:13" (1/3) ... [2025-03-03 23:09:14,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18886bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:14, skipping insertion in model container [2025-03-03 23:09:14,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:13" (2/3) ... [2025-03-03 23:09:14,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18886bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:14, skipping insertion in model container [2025-03-03 23:09:14,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:14" (3/3) ... [2025-03-03 23:09:14,417 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2025-03-03 23:09:14,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:09:14,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:09:14,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:09:14,475 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;@568929b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:09:14,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:09:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:14,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:14,497 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -687193478, now seen corresponding path program 1 times [2025-03-03 23:09:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:09:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899501531] [2025-03-03 23:09:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:14,508 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:09:14,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:09:14,511 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:09:14,513 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:09:14,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:14,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:14,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:14,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:14,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:09:14,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-03 23:09:14,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:14,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:09:14,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899501531] [2025-03-03 23:09:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899501531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:09:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321693833] [2025-03-03 23:09:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:09:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:09:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:09:14,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:09:14,835 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:09:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:14,848 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2025-03-03 23:09:14,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:09:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-03-03 23:09:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:14,853 INFO L225 Difference]: With dead ends: 95 [2025-03-03 23:09:14,853 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:09:14,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:09:14,857 INFO L435 NwaCegarLoop]: 69 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, 69 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:09:14,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:09:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:09:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-03-03 23:09:14,880 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 97 [2025-03-03 23:09:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-03 23:09:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:09:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-03-03 23:09:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:14,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:14,883 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,894 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:09:15,084 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:09:15,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1922032693, now seen corresponding path program 1 times [2025-03-03 23:09:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:09:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050710442] [2025-03-03 23:09:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:15,086 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:09:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:09:15,088 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:09:15,090 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:09:15,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:15,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:15,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:15,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:15,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:09:15,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:09:15,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:15,375 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:09:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050710442] [2025-03-03 23:09:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050710442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:09:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906391475] [2025-03-03 23:09:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:15,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:09:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:09:15,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:09:15,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:09:15,378 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:09:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:15,540 INFO L93 Difference]: Finished difference Result 99 states and 140 transitions. [2025-03-03 23:09:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:09:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2025-03-03 23:09:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:15,542 INFO L225 Difference]: With dead ends: 99 [2025-03-03 23:09:15,543 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 23:09:15,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:09:15,544 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:15,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:09:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 23:09:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-03 23:09:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:09:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-03 23:09:15,556 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 97 [2025-03-03 23:09:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-03 23:09:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:09:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-03 23:09:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 23:09:15,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:15,560 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,571 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 (3)] Ended with exit code 0 [2025-03-03 23:09:15,760 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:09:15,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:15,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1485430922, now seen corresponding path program 1 times [2025-03-03 23:09:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:09:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437538233] [2025-03-03 23:09:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:15,762 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:09:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:09:15,765 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:09:15,766 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:09:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 23:09:15,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 23:09:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:15,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:09:15,988 INFO L279 TraceCheckSpWp]: Computing forward predicates...