./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_dependencies_file-27.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 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:44,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:44,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:46:44,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:44,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:44,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:44,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:44,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:44,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:44,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:44,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:44,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:44,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:44,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:44,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:44,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:44,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:44,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:44,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:44,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:44,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:44,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:44,278 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 -> 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e [2025-03-08 09:46:44,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:44,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:44,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:44,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:44,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:44,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:45,669 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39e4b5c6/b3cee23982cd455392dff386b51b66dc/FLAGfd34d4a37 [2025-03-08 09:46:45,924 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:45,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:45,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39e4b5c6/b3cee23982cd455392dff386b51b66dc/FLAGfd34d4a37 [2025-03-08 09:46:46,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39e4b5c6/b3cee23982cd455392dff386b51b66dc [2025-03-08 09:46:46,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:46,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:46,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:46,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:46,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:46,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46, skipping insertion in model container [2025-03-08 09:46:46,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:46,359 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_codestructure_dependencies_file-27.i[919,932] [2025-03-08 09:46:46,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:46,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:46,415 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_codestructure_dependencies_file-27.i[919,932] [2025-03-08 09:46:46,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:46,441 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:46,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46 WrapperNode [2025-03-08 09:46:46,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:46,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:46,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:46,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:46,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,474 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-08 09:46:46,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:46,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:46,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:46,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:46,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:46:46,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:46,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:46,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:46,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:46,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (1/1) ... [2025-03-08 09:46:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:46,534 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-08 09:46:46,540 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-08 09:46:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:46,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:46:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:46,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:46,612 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:46,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:46,799 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-08 09:46:46,831 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:46,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:46,843 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:46,843 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 09:46:46,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:46 BoogieIcfgContainer [2025-03-08 09:46:46,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:46,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:46,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:46,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:46,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:46" (1/3) ... [2025-03-08 09:46:46,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc3a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:46, skipping insertion in model container [2025-03-08 09:46:46,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:46" (2/3) ... [2025-03-08 09:46:46,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc3a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:46, skipping insertion in model container [2025-03-08 09:46:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:46" (3/3) ... [2025-03-08 09:46:46,851 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:46,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:46,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-27.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:46,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:46,916 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;@2aef1919, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:46,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:46:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:46:46,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:46,931 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:46:46,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:46,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:46,935 INFO L85 PathProgramCache]: Analyzing trace with hash 57572039, now seen corresponding path program 1 times [2025-03-08 09:46:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505633170] [2025-03-08 09:46:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:46:47,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:46:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 09:46:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:47,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505633170] [2025-03-08 09:46:47,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505633170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:46:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237908408] [2025-03-08 09:46:47,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:47,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:47,150 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-08 09:46:47,152 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-08 09:46:47,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:46:47,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:46:47,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:47,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:47,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:46:47,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 09:46:47,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:47,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237908408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:47,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:46:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:46:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813965551] [2025-03-08 09:46:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:47,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:46:47,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:47,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:46:47,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:46:47,323 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:46:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:47,342 INFO L93 Difference]: Finished difference Result 132 states and 221 transitions. [2025-03-08 09:46:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:46:47,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2025-03-08 09:46:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:47,348 INFO L225 Difference]: With dead ends: 132 [2025-03-08 09:46:47,348 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 09:46:47,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-08 09:46:47,353 INFO L435 NwaCegarLoop]: 96 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, 96 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-08 09:46:47,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:46:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 09:46:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 09:46:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:46:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2025-03-08 09:46:47,391 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 131 [2025-03-08 09:46:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2025-03-08 09:46:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:46:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2025-03-08 09:46:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:46:47,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:47,395 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:46:47,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:46:47,596 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-08 09:46:47,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:47,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1767034685, now seen corresponding path program 1 times [2025-03-08 09:46:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-08 09:46:47,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:47,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:46:47,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:46:47,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:47,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:46:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-08 09:46:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110211159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:47,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:46:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702973537] [2025-03-08 09:46:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:47,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:46:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:47,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:46:47,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:46:47,963 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:48,007 INFO L93 Difference]: Finished difference Result 192 states and 288 transitions. [2025-03-08 09:46:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:46:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 09:46:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:48,009 INFO L225 Difference]: With dead ends: 192 [2025-03-08 09:46:48,009 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 09:46:48,009 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-08 09:46:48,010 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:48,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:46:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 09:46:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-08 09:46:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 09:46:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 186 transitions. [2025-03-08 09:46:48,031 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 186 transitions. Word has length 131 [2025-03-08 09:46:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:48,031 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 186 transitions. [2025-03-08 09:46:48,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 186 transitions. [2025-03-08 09:46:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 09:46:48,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:48,033 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:46:48,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:46:48,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:48,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1381725926, now seen corresponding path program 1 times [2025-03-08 09:46:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:48,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-08 09:46:48,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:48,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 09:46:48,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 09:46:48,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:48,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:46:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-08 09:46:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:46:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378471763] [2025-03-08 09:46:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:48,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:46:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:48,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:46:48,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:46:48,293 INFO L87 Difference]: Start difference. First operand 125 states and 186 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:48,421 INFO L93 Difference]: Finished difference Result 249 states and 373 transitions. [2025-03-08 09:46:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:46:48,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-03-08 09:46:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:48,424 INFO L225 Difference]: With dead ends: 249 [2025-03-08 09:46:48,426 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 09:46:48,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 09:46:48,429 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 96 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:48,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 131 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:46:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 09:46:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 09:46:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 09:46:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-03-08 09:46:48,457 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 132 [2025-03-08 09:46:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:48,459 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-03-08 09:46:48,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:46:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-03-08 09:46:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:46:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:48,461 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:46:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:46:48,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 365803301, now seen corresponding path program 1 times [2025-03-08 09:46:48,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:48,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-03-08 09:46:48,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:48,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:48,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:48,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:48,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-03-08 09:46:49,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:46:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-03-08 09:46:49,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645514666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:46:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713111264] [2025-03-08 09:46:49,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:49,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:46:49,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:49,059 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-08 09:46:49,060 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-08 09:46:49,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:49,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:49,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:49,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 09:46:49,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 434 proven. 36 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 09:46:49,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:46:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 117 proven. 45 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-08 09:46:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713111264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:46:49,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:46:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 20 [2025-03-08 09:46:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599619250] [2025-03-08 09:46:49,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:46:49,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:46:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:46:49,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:46:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:46:49,925 INFO L87 Difference]: Start difference. First operand 127 states and 188 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 09:46:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:51,315 INFO L93 Difference]: Finished difference Result 414 states and 574 transitions. [2025-03-08 09:46:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 09:46:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 133 [2025-03-08 09:46:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:51,319 INFO L225 Difference]: With dead ends: 414 [2025-03-08 09:46:51,322 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 09:46:51,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=995, Invalid=3037, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 09:46:51,326 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 593 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:46:51,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 511 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:46:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 09:46:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 243. [2025-03-08 09:46:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 158 states have (on average 1.2088607594936709) internal successors, (191), 159 states have internal predecessors, (191), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 09:46:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2025-03-08 09:46:51,381 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 133 [2025-03-08 09:46:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2025-03-08 09:46:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 09:46:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2025-03-08 09:46:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:46:51,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:51,406 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:46:51,414 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-08 09:46:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 09:46:51,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:51,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1914692923, now seen corresponding path program 1 times [2025-03-08 09:46:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:46:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438887187] [2025-03-08 09:46:51,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:46:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:51,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:51,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:51,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:46:51,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:46:51,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:46:51,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:51,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:46:51,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:46:51,757 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:46:51,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:46:51,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:46:51,762 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 09:46:51,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:46:51,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:46:51 BoogieIcfgContainer [2025-03-08 09:46:51,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:46:51,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:46:51,831 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:46:51,831 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:46:51,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:46" (3/4) ... [2025-03-08 09:46:51,833 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:46:51,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:46:51,835 INFO L158 Benchmark]: Toolchain (without parser) took 5593.04ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 122.7MB in the beginning and 292.5MB in the end (delta: -169.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-08 09:46:51,836 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:51,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:46:51,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:51,837 INFO L158 Benchmark]: Boogie Preprocessor took 33.00ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:51,837 INFO L158 Benchmark]: IcfgBuilder took 335.44ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 84.0MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:46:51,837 INFO L158 Benchmark]: TraceAbstraction took 4985.20ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 83.3MB in the beginning and 292.5MB in the end (delta: -209.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:51,837 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 369.1MB. Free memory was 292.5MB in the beginning and 292.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:46:51,838 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 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.73ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.00ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 335.44ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 84.0MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4985.20ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 83.3MB in the beginning and 292.5MB in the end (delta: -209.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 369.1MB. Free memory was 292.5MB in the beginning and 292.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] FCALL updateLastVariables() [L131] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L95] var_1_5 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L96] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L97] var_1_6 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L98] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L100] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L103] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L107] var_1_15 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L108] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L109] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L111] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L112] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L116] var_1_19 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L117] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L118] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L46] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L48] var_1_20 = var_1_11 [L49] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L50] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L50] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L51] COND TRUE var_1_12 != var_1_21 [L52] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L57] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L68] COND TRUE var_1_14 || var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L69] COND TRUE var_1_14 || var_1_14 [L70] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L77] COND FALSE !(var_1_6 > (- var_1_7)) [L82] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=0] [L84] var_1_22 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L123-L124] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-4294967296, var_1_12=-4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 123 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 931 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 512 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 762 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 419 mSDtfsCounter, 762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=4, InterpolantAutomatonStates: 65, 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, 111 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 2197 SizeOfPredicates, 5 NumberOfNonLiveVariables, 601 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 5165/5320 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-08 09:46:51,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_dependencies_file-27.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 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:46:53,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:46:53,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:46:53,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:46:53,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:46:53,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:46:53,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:46:53,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:46:53,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:46:53,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:46:53,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:46:53,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:46:53,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:46:53,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:46:53,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:46:53,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:46:53,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:46:53,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:46:53,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:46:53,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:46:53,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:46:53,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:46:53,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:46:53,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:46:53,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:53,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:46:53,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:46:53,989 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 -> 66742a05478e72848fd648f016327ac79a7e42b57738bfdecbd0eee20f5e634e [2025-03-08 09:46:54,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:46:54,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:46:54,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:46:54,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:46:54,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:46:54,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:55,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad323cae9/86eabbd249dc480c9c47f007e7a829bc/FLAG221f46bf4 [2025-03-08 09:46:55,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:46:55,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:55,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad323cae9/86eabbd249dc480c9c47f007e7a829bc/FLAG221f46bf4 [2025-03-08 09:46:55,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad323cae9/86eabbd249dc480c9c47f007e7a829bc [2025-03-08 09:46:55,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:46:55,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:46:55,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:55,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:46:55,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:46:55,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:55" (1/1) ... [2025-03-08 09:46:55,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fd9a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:55, skipping insertion in model container [2025-03-08 09:46:55,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:46:55" (1/1) ... [2025-03-08 09:46:55,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:46:56,052 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_codestructure_dependencies_file-27.i[919,932] [2025-03-08 09:46:56,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:56,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:46:56,112 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_codestructure_dependencies_file-27.i[919,932] [2025-03-08 09:46:56,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:46:56,149 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:46:56,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56 WrapperNode [2025-03-08 09:46:56,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:46:56,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:56,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:46:56,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:46:56,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,191 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-08 09:46:56,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:46:56,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:46:56,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:46:56,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:46:56,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,222 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-08 09:46:56,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:46:56,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:46:56,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:46:56,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:46:56,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (1/1) ... [2025-03-08 09:46:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:46:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:46:56,278 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-08 09:46:56,284 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-08 09:46:56,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:46:56,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:46:56,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:46:56,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:46:56,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:46:56,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:46:56,364 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:46:56,366 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:59,923 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:59,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:59,931 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:59,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:59,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:59 BoogieIcfgContainer [2025-03-08 09:46:59,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:59,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:59,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:59,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:59,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:46:55" (1/3) ... [2025-03-08 09:46:59,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449027f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:59, skipping insertion in model container [2025-03-08 09:46:59,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:46:56" (2/3) ... [2025-03-08 09:46:59,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449027f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:59, skipping insertion in model container [2025-03-08 09:46:59,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:59" (3/3) ... [2025-03-08 09:46:59,937 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2025-03-08 09:46:59,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:59,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-27.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:59,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:59,998 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;@6d1747b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:59,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:47:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:47:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:47:00,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:00,008 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:47:00,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -571513913, now seen corresponding path program 1 times [2025-03-08 09:47:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461401200] [2025-03-08 09:47:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:00,020 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-08 09:47:00,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:00,022 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-08 09:47:00,024 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-08 09:47:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:47:00,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:47:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:00,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:47:00,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-08 09:47:00,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:47:00,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461401200] [2025-03-08 09:47:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461401200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:47:00,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:47:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:47:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559694448] [2025-03-08 09:47:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:47:00,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:47:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:47:00,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:47:00,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:47:00,460 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:47:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:47:00,480 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-08 09:47:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:47:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-08 09:47:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:47:00,486 INFO L225 Difference]: With dead ends: 118 [2025-03-08 09:47:00,486 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 09:47:00,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-08 09:47:00,492 INFO L435 NwaCegarLoop]: 88 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, 88 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-08 09:47:00,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:47:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 09:47:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 09:47:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:47:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-03-08 09:47:00,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 128 [2025-03-08 09:47:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:47:00,526 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-03-08 09:47:00,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 09:47:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-03-08 09:47:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:47:00,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:00,528 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:47:00,538 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-08 09:47:00,728 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-08 09:47:00,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:00,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1343172789, now seen corresponding path program 1 times [2025-03-08 09:47:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:00,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361671024] [2025-03-08 09:47:00,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:00,731 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-08 09:47:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:00,733 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-08 09:47:00,734 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-08 09:47:00,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:47:01,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:47:01,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:01,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:01,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 09:47:01,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-08 09:47:01,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:47:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:47:01,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361671024] [2025-03-08 09:47:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361671024] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 09:47:01,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:47:01,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 09:47:01,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628599373] [2025-03-08 09:47:01,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:47:01,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:47:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:47:01,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:47:01,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:47:01,925 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:47:06,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:47:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:47:06,359 INFO L93 Difference]: Finished difference Result 119 states and 176 transitions. [2025-03-08 09:47:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:47:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-08 09:47:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:47:06,388 INFO L225 Difference]: With dead ends: 119 [2025-03-08 09:47:06,388 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 09:47:06,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:47:06,389 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:47:06,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 09:47:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 09:47:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 09:47:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 09:47:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2025-03-08 09:47:06,398 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 128 [2025-03-08 09:47:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:47:06,398 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2025-03-08 09:47:06,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:47:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2025-03-08 09:47:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 09:47:06,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:06,402 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:47:06,412 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-08 09:47:06,603 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-08 09:47:06,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1642934057, now seen corresponding path program 1 times [2025-03-08 09:47:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436187966] [2025-03-08 09:47:06,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:06,605 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-08 09:47:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:06,607 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-08 09:47:06,607 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-08 09:47:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:47:06,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:47:06,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:06,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:06,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 09:47:06,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 09:47:07,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:47:07,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436187966] [2025-03-08 09:47:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436187966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:47:07,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:47:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:47:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252009458] [2025-03-08 09:47:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:47:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:47:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:47:07,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:47:07,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:47:07,617 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:47:10,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:47:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:47:10,944 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2025-03-08 09:47:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:47:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-03-08 09:47:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:47:10,971 INFO L225 Difference]: With dead ends: 183 [2025-03-08 09:47:10,971 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 09:47:10,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-08 09:47:10,972 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 17 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:47:10,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 09:47:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 09:47:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-08 09:47:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 74 states have internal predecessors, (90), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 09:47:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2025-03-08 09:47:10,996 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 129 [2025-03-08 09:47:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:47:10,997 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2025-03-08 09:47:10,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 09:47:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2025-03-08 09:47:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:47:10,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:10,998 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:47:11,009 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 (4)] Ended with exit code 0 [2025-03-08 09:47:11,198 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-08 09:47:11,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:11,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 948679565, now seen corresponding path program 1 times [2025-03-08 09:47:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:11,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849771806] [2025-03-08 09:47:11,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:11,200 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-08 09:47:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:11,202 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-08 09:47:11,203 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-08 09:47:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:47:11,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:47:11,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:11,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:11,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 09:47:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 434 proven. 36 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 09:47:12,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:47:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 117 proven. 45 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-08 09:47:13,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849771806] [2025-03-08 09:47:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849771806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:47:13,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:47:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-03-08 09:47:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370920407] [2025-03-08 09:47:13,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:47:13,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 09:47:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:47:13,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 09:47:13,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:47:13,634 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 09:47:18,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:47:20,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:47:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:47:22,199 INFO L93 Difference]: Finished difference Result 408 states and 542 transitions. [2025-03-08 09:47:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 09:47:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 130 [2025-03-08 09:47:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:47:22,203 INFO L225 Difference]: With dead ends: 408 [2025-03-08 09:47:22,203 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 09:47:22,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=995, Invalid=3037, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 09:47:22,207 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 297 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:47:22,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 367 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-08 09:47:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 09:47:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 235. [2025-03-08 09:47:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 146 states have (on average 1.143835616438356) internal successors, (167), 147 states have internal predecessors, (167), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 09:47:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2025-03-08 09:47:22,232 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 130 [2025-03-08 09:47:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:47:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2025-03-08 09:47:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 09:47:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2025-03-08 09:47:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:47:22,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:47:22,240 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:47:22,251 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-08 09:47:22,441 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-08 09:47:22,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:47:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:47:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash -81625299, now seen corresponding path program 1 times [2025-03-08 09:47:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:47:22,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999441816] [2025-03-08 09:47:22,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:22,442 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-08 09:47:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:47:22,445 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-08 09:47:22,446 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-08 09:47:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:47:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:47:22,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:22,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 09:47:22,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 384 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 09:47:25,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:47:25,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:47:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999441816] [2025-03-08 09:47:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999441816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:47:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1977443400] [2025-03-08 09:47:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:47:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 09:47:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 09:47:25,596 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 09:47:25,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 09:47:25,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:47:26,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:47:26,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:47:26,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:47:26,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 09:47:26,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:47:57,460 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 09:48:23,514 WARN L286 SmtUtils]: Spent 9.12s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)