./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.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-9.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 ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:00,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:00,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:00,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:00,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:00,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:00,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:00,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:00,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:00,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:00,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:00,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:00,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:00,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:00,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:00,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:00,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:00,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:00,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:00,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:00,197 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 -> ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 [2025-03-03 23:15:00,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:00,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:00,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:00,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:00,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:00,466 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-9.i [2025-03-03 23:15:01,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04166d12/3084a342ea4a4200bd1ac92d7727c14a/FLAGb70874626 [2025-03-03 23:15:01,805 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:01,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2025-03-03 23:15:01,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04166d12/3084a342ea4a4200bd1ac92d7727c14a/FLAGb70874626 [2025-03-03 23:15:02,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04166d12/3084a342ea4a4200bd1ac92d7727c14a [2025-03-03 23:15:02,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:02,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:02,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:02,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:02,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:02,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ac0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02, skipping insertion in model container [2025-03-03 23:15:02,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:02,288 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-9.i[914,927] [2025-03-03 23:15:02,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:02,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:02,345 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-9.i[914,927] [2025-03-03 23:15:02,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:02,385 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:02,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02 WrapperNode [2025-03-03 23:15:02,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:02,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:02,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:02,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:02,394 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:15:02" (1/1) ... [2025-03-03 23:15:02,400 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:15:02" (1/1) ... [2025-03-03 23:15:02,422 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-03 23:15:02,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:02,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:02,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:02,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:02,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,448 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:15:02,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:02,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:02,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:02,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:02,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (1/1) ... [2025-03-03 23:15:02,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:02,491 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:15:02,493 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:15:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:02,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:02,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:02,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:02,557 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:02,691 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L75: havoc property_#t~bitwise8#1;havoc property_#t~short9#1; [2025-03-03 23:15:02,703 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:02,703 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:02,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:02,714 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:02,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:02 BoogieIcfgContainer [2025-03-03 23:15:02,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:02,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:02,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:02,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:02,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:02" (1/3) ... [2025-03-03 23:15:02,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543b09ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:02, skipping insertion in model container [2025-03-03 23:15:02,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:02" (2/3) ... [2025-03-03 23:15:02,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543b09ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:02, skipping insertion in model container [2025-03-03 23:15:02,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:02" (3/3) ... [2025-03-03 23:15:02,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i [2025-03-03 23:15:02,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:02,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:02,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:02,787 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;@2a8561f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:02,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 23:15:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 23:15:02,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:02,797 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 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:15:02,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1294960015, now seen corresponding path program 1 times [2025-03-03 23:15:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886170528] [2025-03-03 23:15:02,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:02,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 23:15:02,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 23:15:02,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:02,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 23:15:02,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:02,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886170528] [2025-03-03 23:15:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886170528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738517556] [2025-03-03 23:15:02,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:02,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:02,970 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:15:02,972 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:15:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 23:15:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 23:15:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:03,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:03,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 23:15:03,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:03,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738517556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:03,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926159902] [2025-03-03 23:15:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:03,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:03,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:03,093 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 23:15:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:03,108 INFO L93 Difference]: Finished difference Result 77 states and 110 transitions. [2025-03-03 23:15:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:03,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-03 23:15:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:03,116 INFO L225 Difference]: With dead ends: 77 [2025-03-03 23:15:03,116 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 23:15:03,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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:15:03,122 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:03,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 23:15:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 23:15:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 23:15:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-03 23:15:03,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 45 [2025-03-03 23:15:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:03,160 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-03 23:15:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 23:15:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-03-03 23:15:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 23:15:03,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:03,163 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 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:15:03,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:15:03,367 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:15:03,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -842889362, now seen corresponding path program 1 times [2025-03-03 23:15:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681967362] [2025-03-03 23:15:03,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 23:15:03,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 23:15:03,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:03,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681967362] [2025-03-03 23:15:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681967362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:03,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:15:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050411658] [2025-03-03 23:15:03,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:03,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:15:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:15:03,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:15:03,523 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:03,606 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2025-03-03 23:15:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-03-03 23:15:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:03,609 INFO L225 Difference]: With dead ends: 119 [2025-03-03 23:15:03,610 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 23:15:03,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:15:03,611 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:03,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 135 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:15:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 23:15:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2025-03-03 23:15:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-03-03 23:15:03,625 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 45 [2025-03-03 23:15:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:03,625 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-03-03 23:15:03,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-03-03 23:15:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 23:15:03,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:03,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 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:15:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:03,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:03,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1995460737, now seen corresponding path program 1 times [2025-03-03 23:15:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454510397] [2025-03-03 23:15:03,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:03,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 23:15:03,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 23:15:03,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:03,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454510397] [2025-03-03 23:15:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454510397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:15:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455200429] [2025-03-03 23:15:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:15:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:03,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:15:03,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:15:03,779 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:03,817 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2025-03-03 23:15:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:15:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-03-03 23:15:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:03,820 INFO L225 Difference]: With dead ends: 153 [2025-03-03 23:15:03,821 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 23:15:03,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:15:03,822 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 87 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:03,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 23:15:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2025-03-03 23:15:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-03-03 23:15:03,838 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 46 [2025-03-03 23:15:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:03,839 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-03-03 23:15:03,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-03-03 23:15:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 23:15:03,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:03,840 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:15:03,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 308108421, now seen corresponding path program 1 times [2025-03-03 23:15:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428007258] [2025-03-03 23:15:03,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:03,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 23:15:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 23:15:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428007258] [2025-03-03 23:15:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428007258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:04,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:04,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:15:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340260714] [2025-03-03 23:15:04,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:15:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:04,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:15:04,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:15:04,188 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:04,245 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2025-03-03 23:15:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2025-03-03 23:15:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:04,247 INFO L225 Difference]: With dead ends: 137 [2025-03-03 23:15:04,247 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 23:15:04,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:15:04,248 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 23:15:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-03 23:15:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-03-03 23:15:04,261 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 47 [2025-03-03 23:15:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:04,261 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-03 23:15:04,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-03-03 23:15:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 23:15:04,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:04,262 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:15:04,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash 550189584, now seen corresponding path program 1 times [2025-03-03 23:15:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112439704] [2025-03-03 23:15:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 23:15:04,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 23:15:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:15:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348367115] [2025-03-03 23:15:04,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:04,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:04,297 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:15:04,298 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:15:04,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 23:15:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 23:15:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:04,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:04,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 23:15:04,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 23:15:04,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:04,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:04,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:15:04,421 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:15:04,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:04,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:15:04,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:04,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 23:15:04,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:04,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:04 BoogieIcfgContainer [2025-03-03 23:15:04,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:04,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:04,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:04,661 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:04,662 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:02" (3/4) ... [2025-03-03 23:15:04,663 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:15:04,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:04,664 INFO L158 Benchmark]: Toolchain (without parser) took 2497.49ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 65.1MB in the end (delta: 40.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-03 23:15:04,665 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:04,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.53ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:04,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.71ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:04,666 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:04,667 INFO L158 Benchmark]: IcfgBuilder took 248.08ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 71.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:04,667 INFO L158 Benchmark]: TraceAbstraction took 1944.70ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 65.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2025-03-03 23:15:04,667 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 65.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:04,668 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.53ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.71ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.08ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 71.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1944.70ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 65.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 65.1MB in the end (delta: 37.0kB). 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 shiftLeft at line 50, overapproximation of shiftLeft at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed short int last_1_var_1_8 = 100; [L31] double last_1_var_1_10 = 9.2; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L71] last_1_var_1_8 = var_1_8 [L72] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L62] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L63] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L63] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L64] var_1_7 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L65] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L66] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L67] var_1_11 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L68] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L84] RET updateVariables() [L85] CALL step() [L35] COND FALSE !(last_1_var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L38] COND FALSE !(((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) [L45] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=64] [L50] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE (10 << var_1_9) < (var_1_3 * var_1_1) [L51] var_1_8 = (var_1_9 + var_1_1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L53] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L54] COND TRUE ((var_1_1 + var_1_9) < 10) || stepLocal_0 [L55] var_1_12 = ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L85] RET step() [L86] CALL, EXPR property() [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75-L76] return (((((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((var_1_1 + var_1_9) < 10) || (var_1_10 > var_1_10)) ? (var_1_12 == ((signed short int) ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))))) : (var_1_12 == ((signed short int) var_1_8))) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 206 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 135 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 192/200 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:15:04,683 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-9.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 ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:06,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:06,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:15:06,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:06,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:06,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:06,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:06,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:06,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:06,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:06,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:06,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:06,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:06,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:06,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:06,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:06,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:06,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:06,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:06,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:06,662 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 -> ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 [2025-03-03 23:15:06,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:06,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:06,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:06,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:06,891 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:06,893 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-9.i [2025-03-03 23:15:08,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc17c67/7b19e9fba8634d2eb9490822007d4b0a/FLAGde25fd921 [2025-03-03 23:15:08,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:08,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2025-03-03 23:15:08,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc17c67/7b19e9fba8634d2eb9490822007d4b0a/FLAGde25fd921 [2025-03-03 23:15:08,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc17c67/7b19e9fba8634d2eb9490822007d4b0a [2025-03-03 23:15:08,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:08,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:08,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:08,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:08,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:08,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4af3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08, skipping insertion in model container [2025-03-03 23:15:08,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:08,735 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-9.i[914,927] [2025-03-03 23:15:08,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:08,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:08,796 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-9.i[914,927] [2025-03-03 23:15:08,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:08,822 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:08,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08 WrapperNode [2025-03-03 23:15:08,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:08,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:08,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:08,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:08,827 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:15:08" (1/1) ... [2025-03-03 23:15:08,834 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:15:08" (1/1) ... [2025-03-03 23:15:08,847 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-03-03 23:15:08,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:08,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:08,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:08,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:08,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,864 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:15:08,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:08,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:08,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:08,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:08,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (1/1) ... [2025-03-03 23:15:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:08,908 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:15:08,911 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:15:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:15:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:08,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:08,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:08,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:08,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:09,203 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:09,203 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:09,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:09,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:09,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:09 BoogieIcfgContainer [2025-03-03 23:15:09,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:09,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:09,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:09,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:09,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:08" (1/3) ... [2025-03-03 23:15:09,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766bcd95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:09, skipping insertion in model container [2025-03-03 23:15:09,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:08" (2/3) ... [2025-03-03 23:15:09,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766bcd95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:09, skipping insertion in model container [2025-03-03 23:15:09,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:09" (3/3) ... [2025-03-03 23:15:09,223 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i [2025-03-03 23:15:09,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:09,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:09,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:09,285 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;@195c80e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:09,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 23:15:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 23:15:09,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:09,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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:15:09,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:09,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -947004480, now seen corresponding path program 1 times [2025-03-03 23:15:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159428100] [2025-03-03 23:15:09,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:09,303 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:15:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:09,307 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:15:09,308 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:15:09,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 23:15:09,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 23:15:09,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:09,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:09,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 23:15:09,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:09,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159428100] [2025-03-03 23:15:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159428100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:15:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958606066] [2025-03-03 23:15:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:09,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:09,437 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 23:15:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:09,452 INFO L93 Difference]: Finished difference Result 62 states and 88 transitions. [2025-03-03 23:15:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:09,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-03 23:15:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:09,457 INFO L225 Difference]: With dead ends: 62 [2025-03-03 23:15:09,457 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 23:15:09,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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:15:09,461 INFO L435 NwaCegarLoop]: 39 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, 39 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:15:09,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 23:15:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 23:15:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 23:15:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-03 23:15:09,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 42 [2025-03-03 23:15:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-03 23:15:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 23:15:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-03 23:15:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 23:15:09,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:09,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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:15:09,504 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:15:09,703 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:15:09,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -415089087, now seen corresponding path program 1 times [2025-03-03 23:15:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464399135] [2025-03-03 23:15:09,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:09,705 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:15:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:09,708 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:15:09,709 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:15:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 23:15:09,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 23:15:09,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:09,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:09,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:15:09,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:09,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:09,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464399135] [2025-03-03 23:15:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464399135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:15:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67115287] [2025-03-03 23:15:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:15:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:09,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:15:09,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:15:09,955 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:10,034 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2025-03-03 23:15:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2025-03-03 23:15:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:10,035 INFO L225 Difference]: With dead ends: 90 [2025-03-03 23:15:10,035 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 23:15:10,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:15:10,036 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:10,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:15:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 23:15:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-03-03 23:15:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-03-03 23:15:10,045 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 42 [2025-03-03 23:15:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-03-03 23:15:10,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-03-03 23:15:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 23:15:10,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:10,046 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 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:15:10,051 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:15:10,247 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:15:10,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -324216829, now seen corresponding path program 1 times [2025-03-03 23:15:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987447967] [2025-03-03 23:15:10,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:10,248 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:15:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:10,250 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:15:10,251 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:15:10,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 23:15:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 23:15:10,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:10,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:15:10,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:10,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:10,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987447967] [2025-03-03 23:15:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987447967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:15:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290227946] [2025-03-03 23:15:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:10,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:15:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:10,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:15:10,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:15:10,368 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:10,449 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2025-03-03 23:15:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-03 23:15:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:10,451 INFO L225 Difference]: With dead ends: 120 [2025-03-03 23:15:10,451 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:15:10,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:15:10,452 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:10,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:15:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:15:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2025-03-03 23:15:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2025-03-03 23:15:10,460 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 43 [2025-03-03 23:15:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:10,460 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2025-03-03 23:15:10,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2025-03-03 23:15:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 23:15:10,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:10,461 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 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:15:10,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:15:10,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:15:10,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:10,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash -323293308, now seen corresponding path program 1 times [2025-03-03 23:15:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:10,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368958312] [2025-03-03 23:15:10,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:10,663 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:15:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:10,666 INFO L229 MonitoredProcess]: Starting monitored process 5 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:15:10,667 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 (5)] Waiting until timeout for monitored process [2025-03-03 23:15:10,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 23:15:10,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 23:15:10,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:10,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:10,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:15:10,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 23:15:13,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:13,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368958312] [2025-03-03 23:15:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368958312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:15:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286079043] [2025-03-03 23:15:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:15:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:13,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:15:13,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:15:13,924 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:14,546 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2025-03-03 23:15:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:15:14,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-03 23:15:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:14,549 INFO L225 Difference]: With dead ends: 77 [2025-03-03 23:15:14,549 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 23:15:14,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:15:14,552 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 107 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:15:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 23:15:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2025-03-03 23:15:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:15:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-03 23:15:14,561 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 43 [2025-03-03 23:15:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:14,563 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-03 23:15:14,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-03 23:15:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 23:15:14,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:14,565 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 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:15:14,569 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 (5)] Ended with exit code 0 [2025-03-03 23:15:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:15:14,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1210796989, now seen corresponding path program 1 times [2025-03-03 23:15:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820752035] [2025-03-03 23:15:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:14,767 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:15:14,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:14,772 INFO L229 MonitoredProcess]: Starting monitored process 6 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:15:14,773 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 (6)] Waiting until timeout for monitored process [2025-03-03 23:15:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 23:15:14,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 23:15:14,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:14,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:14,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:15:14,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 23:15:17,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:17,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:17,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820752035] [2025-03-03 23:15:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820752035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:17,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:17,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:15:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811976789] [2025-03-03 23:15:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:17,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:15:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:17,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:15:17,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:15:17,893 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:18,471 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-03 23:15:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:15:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-03 23:15:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:18,472 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:15:18,472 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:15:18,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:15:18,473 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:18,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 122 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:15:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:15:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:15:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 23:15:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:15:18,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-03 23:15:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:18,474 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:15:18,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 23:15:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:15:18,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:15:18,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:18,480 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 (6)] Ended with exit code 0 [2025-03-03 23:15:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:15:18,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 23:15:18,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:15:19,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:19,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,525 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-03 23:15:19,526 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-03 23:15:19,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:19 BoogieIcfgContainer [2025-03-03 23:15:19,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:19,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:19,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:19,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:19,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:09" (3/4) ... [2025-03-03 23:15:19,530 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 23:15:19,534 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 23:15:19,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 23:15:19,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 23:15:19,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 23:15:19,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 23:15:19,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 23:15:19,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 23:15:19,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:19,592 INFO L158 Benchmark]: Toolchain (without parser) took 10983.68ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 91.8MB in the beginning and 475.5MB in the end (delta: -383.7MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. [2025-03-03 23:15:19,593 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:19,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.32ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 79.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:19,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.61ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:19,594 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:19,594 INFO L158 Benchmark]: IcfgBuilder took 336.37ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 62.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:19,594 INFO L158 Benchmark]: TraceAbstraction took 10310.25ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 61.7MB in the beginning and 479.5MB in the end (delta: -417.8MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. [2025-03-03 23:15:19,594 INFO L158 Benchmark]: Witness Printer took 63.43ms. Allocated memory is still 755.0MB. Free memory was 479.5MB in the beginning and 475.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:19,595 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.36ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.32ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 79.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.61ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 336.37ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 62.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10310.25ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 61.7MB in the beginning and 479.5MB in the end (delta: -417.8MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. * Witness Printer took 63.43ms. Allocated memory is still 755.0MB. Free memory was 479.5MB in the beginning and 475.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 166 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 40, 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, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 21 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Location Invariant Derived location invariant: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64))) RESULT: Ultimate proved your program to be correct! [2025-03-03 23:15:19,615 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 Writing output log to file Ultimate.log Result: TRUE