./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:10:38,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:10:38,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:10:38,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:10:38,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:10:38,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:10:38,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:10:38,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:10:38,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:10:38,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:10:38,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:10:38,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:10:38,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:10:38,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:10:38,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:10:38,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:10:38,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:10:38,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:10:38,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:10:38,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:10:38,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:10:38,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:10:38,228 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-16 23:10:38,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:10:38,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:10:38,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:10:38,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:10:38,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:10:38,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-16 23:10:39,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeb93e9a/51287c087de24090907ae205c81438b6/FLAG0abbef473 [2025-03-16 23:10:39,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:10:39,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-16 23:10:39,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeb93e9a/51287c087de24090907ae205c81438b6/FLAG0abbef473 [2025-03-16 23:10:39,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeb93e9a/51287c087de24090907ae205c81438b6 [2025-03-16 23:10:39,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:10:39,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:10:39,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:10:39,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:10:39,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:10:39,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:10:39" (1/1) ... [2025-03-16 23:10:39,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:39, skipping insertion in model container [2025-03-16 23:10:39,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:10:39" (1/1) ... [2025-03-16 23:10:39,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:10:40,000 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_normal_file-59.i[913,926] [2025-03-16 23:10:40,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:10:40,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:10:40,072 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_normal_file-59.i[913,926] [2025-03-16 23:10:40,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:10:40,111 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:10:40,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40 WrapperNode [2025-03-16 23:10:40,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:10:40,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:10:40,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:10:40,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:10:40,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,146 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-16 23:10:40,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:10:40,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:10:40,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:10:40,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:10:40,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,168 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-16 23:10:40,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:10:40,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:10:40,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:10:40,192 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:10:40,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (1/1) ... [2025-03-16 23:10:40,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:10:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:10:40,219 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-16 23:10:40,225 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-16 23:10:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:10:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:10:40,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:10:40,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:10:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:10:40,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:10:40,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:10:40,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:10:40,523 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:10:40,523 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:10:40,531 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:10:40,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:10:40,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:10:40 BoogieIcfgContainer [2025-03-16 23:10:40,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:10:40,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:10:40,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:10:40,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:10:40,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:10:39" (1/3) ... [2025-03-16 23:10:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c4b42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:10:40, skipping insertion in model container [2025-03-16 23:10:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:40" (2/3) ... [2025-03-16 23:10:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c4b42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:10:40, skipping insertion in model container [2025-03-16 23:10:40,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:10:40" (3/3) ... [2025-03-16 23:10:40,541 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-16 23:10:40,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:10:40,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:10:40,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:10:40,603 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;@371ae7e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:10:40,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:10:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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-16 23:10:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:10:40,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:40,614 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] [2025-03-16 23:10:40,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1678599475, now seen corresponding path program 1 times [2025-03-16 23:10:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:10:40,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-03-16 23:10:40,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:10:40,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:10:40,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:10:40,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:40,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:40,874 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-16 23:10:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:10:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-03-16 23:10:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405512241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:10:40,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997441163] [2025-03-16 23:10:40,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:10:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:10:40,878 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-16 23:10:40,880 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-16 23:10:40,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:10:41,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:10:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:41,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:41,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:10:41,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:10:41,055 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-16 23:10:41,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:10:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997441163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:10:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:10:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:10:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825959660] [2025-03-16 23:10:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:10:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:10:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:10:41,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:10:41,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:10:41,083 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-16 23:10:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:41,104 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2025-03-16 23:10:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:10:41,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 121 [2025-03-16 23:10:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:41,112 INFO L225 Difference]: With dead ends: 105 [2025-03-16 23:10:41,113 INFO L226 Difference]: Without dead ends: 52 [2025-03-16 23:10:41,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-16 23:10:41,119 INFO L435 NwaCegarLoop]: 81 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, 81 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-16 23:10:41,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:10:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-16 23:10:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-16 23:10:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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-16 23:10:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 81 transitions. [2025-03-16 23:10:41,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 81 transitions. Word has length 121 [2025-03-16 23:10:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 81 transitions. [2025-03-16 23:10:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-16 23:10:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2025-03-16 23:10:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:10:41,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:41,161 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] [2025-03-16 23:10:41,169 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-16 23:10:41,362 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-16 23:10:41,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:41,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2089111535, now seen corresponding path program 1 times [2025-03-16 23:10:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:10:41,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-16 23:10:41,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:10:41,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:10:41,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:10:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:41,747 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-16 23:10:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:10:41,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-16 23:10:41,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:10:41,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:10:41,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:10:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481112241] [2025-03-16 23:10:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:10:41,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:10:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:10:41,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:10:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:10:41,749 INFO L87 Difference]: Start difference. First operand 52 states and 81 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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-16 23:10:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:41,811 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2025-03-16 23:10:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:10:41,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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 121 [2025-03-16 23:10:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:41,814 INFO L225 Difference]: With dead ends: 123 [2025-03-16 23:10:41,814 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 23:10:41,815 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-16 23:10:41,815 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:10:41,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 148 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:10:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 23:10:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-16 23:10:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:10:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2025-03-16 23:10:41,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 121 [2025-03-16 23:10:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:41,824 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2025-03-16 23:10:41,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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-16 23:10:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2025-03-16 23:10:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 23:10:41,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:41,825 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] [2025-03-16 23:10:41,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:10:41,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -918698254, now seen corresponding path program 1 times [2025-03-16 23:10:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:10:41,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-03-16 23:10:41,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:10:41,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 23:10:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 23:10:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:10:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707027888] [2025-03-16 23:10:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:41,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:10:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:10:41,996 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-16 23:10:41,997 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-16 23:10:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 23:10:42,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 23:10:42,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:42,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:42,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 23:10:42,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:10:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-16 23:10:43,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:10:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:10:44,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-03-16 23:10:44,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:10:44,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707027888] [2025-03-16 23:10:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707027888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:10:44,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:10:44,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-16 23:10:44,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733425222] [2025-03-16 23:10:44,146 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 23:10:44,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:10:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:10:44,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:10:44,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-16 23:10:44,149 INFO L87 Difference]: Start difference. First operand 69 states and 106 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-16 23:10:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:44,916 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2025-03-16 23:10:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 23:10:44,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 122 [2025-03-16 23:10:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:44,918 INFO L225 Difference]: With dead ends: 182 [2025-03-16 23:10:44,918 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 23:10:44,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=664, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:10:44,919 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 172 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:10:44,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 213 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:10:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 23:10:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2025-03-16 23:10:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:10:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2025-03-16 23:10:44,931 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 122 [2025-03-16 23:10:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:44,932 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2025-03-16 23:10:44,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-16 23:10:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2025-03-16 23:10:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 23:10:44,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:44,933 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] [2025-03-16 23:10:44,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:10:45,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 23:10:45,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -31194573, now seen corresponding path program 1 times [2025-03-16 23:10:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:10:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736750053] [2025-03-16 23:10:45,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:10:45,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 23:10:45,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 23:10:45,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:45,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:45,231 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-16 23:10:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:10:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736750053] [2025-03-16 23:10:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736750053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:10:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:10:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:10:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326601544] [2025-03-16 23:10:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:10:45,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:10:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:10:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:10:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:10:45,233 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-16 23:10:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:45,268 INFO L93 Difference]: Finished difference Result 187 states and 255 transitions. [2025-03-16 23:10:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:10:45,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 122 [2025-03-16 23:10:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:45,274 INFO L225 Difference]: With dead ends: 187 [2025-03-16 23:10:45,274 INFO L226 Difference]: Without dead ends: 100 [2025-03-16 23:10:45,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:10:45,275 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:10:45,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:10:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-16 23:10:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-03-16 23:10:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:10:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2025-03-16 23:10:45,296 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 122 [2025-03-16 23:10:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2025-03-16 23:10:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-16 23:10:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2025-03-16 23:10:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 23:10:45,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:45,301 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] [2025-03-16 23:10:45,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:10:45,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1615633138, now seen corresponding path program 1 times [2025-03-16 23:10:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:10:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541594901] [2025-03-16 23:10:45,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:10:45,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:10:45,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:10:45,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:45,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:10:45,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038902466] [2025-03-16 23:10:45,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:45,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:10:45,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:10:45,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:10:45,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:10:45,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:10:45,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:10:45,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:45,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:10:45,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:10:45,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:10:45,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:10:45,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:45,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:10:45,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:10:45,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:10:45,600 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:10:45,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:10:45,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:10:45,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:10:45,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:10:45,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:10:45 BoogieIcfgContainer [2025-03-16 23:10:45,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:10:45,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:10:45,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:10:45,865 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:10:45,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:10:40" (3/4) ... [2025-03-16 23:10:45,867 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:10:45,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:10:45,868 INFO L158 Benchmark]: Toolchain (without parser) took 5995.72ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 104.6MB in the beginning and 259.5MB in the end (delta: -154.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-03-16 23:10:45,868 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:10:45,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 90.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:10:45,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.36ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:10:45,869 INFO L158 Benchmark]: Boogie Preprocessor took 44.51ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 81.5MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:10:45,869 INFO L158 Benchmark]: IcfgBuilder took 340.01ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 59.3MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:10:45,869 INFO L158 Benchmark]: TraceAbstraction took 5326.42ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 259.6MB in the end (delta: -201.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:10:45,869 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 318.8MB. Free memory was 259.6MB in the beginning and 259.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:10:45,870 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 90.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.36ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.51ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 81.5MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 340.01ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 59.3MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5326.42ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 259.6MB in the end (delta: -201.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 318.8MB. Free memory was 259.6MB in the beginning and 259.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 25; [L26] unsigned short int var_1_5 = 0; [L27] unsigned short int var_1_6 = 62100; [L28] unsigned short int var_1_7 = 27651; [L29] double var_1_8 = 128.9; [L30] unsigned char var_1_9 = 1; [L31] double var_1_10 = 16.5; [L32] double var_1_11 = 25.5; [L33] double var_1_12 = 199.75; [L34] unsigned char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 1; [L38] unsigned short int var_1_17 = 32; [L39] unsigned char var_1_18 = 1; [L40] unsigned long int var_1_19 = 1; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L103] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L112] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L113] var_1_11 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L114] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L115] var_1_12 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L116] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L135] RET updateVariables() [L136] CALL step() [L44] COND FALSE !((var_1_3 != (16 / var_1_4)) && var_1_2) [L55] var_1_1 = var_1_3 VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=0, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L60] COND TRUE ! var_1_2 [L61] var_1_5 = ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=1289/10, var_1_9=1] [L64] COND FALSE !(\read(var_1_2)) [L71] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] [L73] COND TRUE var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5)))) VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] [L74] COND TRUE var_1_3 <= var_1_6 [L75] var_1_13 = 32 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] [L82] COND TRUE var_1_12 != var_1_8 [L83] var_1_15 = (! var_1_16) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] [L87] var_1_17 = var_1_4 [L88] var_1_18 = var_1_16 [L89] var_1_19 = var_1_4 [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return (((((((((var_1_3 != (16 / var_1_4)) && var_1_2) ? ((var_1_3 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_3))) : (var_1_2 ? (var_1_1 == ((unsigned short int) var_1_3)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_3))) && ((var_1_1 < var_1_3) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - var_1_3)))) : ((! var_1_2) ? (var_1_5 == ((unsigned short int) ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))))) : 1))) && (var_1_2 ? (((! var_1_9) || (var_1_5 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))))) ? ((var_1_3 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=253, var_1_18=1, var_1_19=253, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=253, var_1_18=1, var_1_19=253, var_1_1=1, var_1_2=0, var_1_3=257, var_1_4=253, var_1_5=16636, var_1_6=32889, var_1_7=16383, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 592 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 312 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 34, 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, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 602 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 6 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3648/3800 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-16 23:10:45,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:10:47,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:10:47,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:10:47,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:10:47,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:10:47,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:10:47,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:10:47,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:10:47,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:10:47,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:10:47,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:10:47,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:10:47,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:10:47,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:10:47,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:10:47,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:10:47,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:10:47,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:10:47,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:10:47,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:10:47,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:10:47,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:10:47,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:10:47,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:10:47,806 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-16 23:10:48,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:10:48,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:10:48,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:10:48,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:10:48,043 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:10:48,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-16 23:10:49,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc81dab5/0ec609e125e84f3084715537c70eaeed/FLAGa8695aa1f [2025-03-16 23:10:49,385 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:10:49,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-16 23:10:49,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc81dab5/0ec609e125e84f3084715537c70eaeed/FLAGa8695aa1f [2025-03-16 23:10:49,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc81dab5/0ec609e125e84f3084715537c70eaeed [2025-03-16 23:10:49,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:10:49,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:10:49,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:10:49,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:10:49,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:10:49,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abd894a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49, skipping insertion in model container [2025-03-16 23:10:49,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:10:49,543 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_normal_file-59.i[913,926] [2025-03-16 23:10:49,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:10:49,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:10:49,617 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_normal_file-59.i[913,926] [2025-03-16 23:10:49,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:10:49,663 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:10:49,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49 WrapperNode [2025-03-16 23:10:49,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:10:49,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:10:49,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:10:49,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:10:49,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,703 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-16 23:10:49,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:10:49,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:10:49,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:10:49,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:10:49,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,736 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-16 23:10:49,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:10:49,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:10:49,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:10:49,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:10:49,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (1/1) ... [2025-03-16 23:10:49,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:10:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:10:49,792 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-16 23:10:49,797 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-16 23:10:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:10:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:10:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:10:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:10:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:10:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:10:49,872 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:10:49,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:10:50,466 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:10:50,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:10:50,476 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:10:50,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:10:50,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:10:50 BoogieIcfgContainer [2025-03-16 23:10:50,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:10:50,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:10:50,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:10:50,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:10:50,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:10:49" (1/3) ... [2025-03-16 23:10:50,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e54e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:10:50, skipping insertion in model container [2025-03-16 23:10:50,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:10:49" (2/3) ... [2025-03-16 23:10:50,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e54e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:10:50, skipping insertion in model container [2025-03-16 23:10:50,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:10:50" (3/3) ... [2025-03-16 23:10:50,483 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-16 23:10:50,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:10:50,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:10:50,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:10:50,541 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;@4c7836ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:10:50,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:10:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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-16 23:10:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:10:50,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:50,551 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] [2025-03-16 23:10:50,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1678599475, now seen corresponding path program 1 times [2025-03-16 23:10:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:10:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297488275] [2025-03-16 23:10:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:50,565 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-16 23:10:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:10:50,567 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-16 23:10:50,568 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-16 23:10:50,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:10:50,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:10:50,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:50,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:50,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:10:50,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:10:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 23:10:50,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:10:50,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:10:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297488275] [2025-03-16 23:10:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297488275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:10:50,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:10:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:10:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430906752] [2025-03-16 23:10:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:10:50,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:10:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:10:50,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:10:50,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:10:50,843 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-16 23:10:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:50,857 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2025-03-16 23:10:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:10:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 121 [2025-03-16 23:10:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:50,866 INFO L225 Difference]: With dead ends: 105 [2025-03-16 23:10:50,866 INFO L226 Difference]: Without dead ends: 52 [2025-03-16 23:10:50,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-16 23:10:50,870 INFO L435 NwaCegarLoop]: 81 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, 81 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-16 23:10:50,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:10:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-16 23:10:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-16 23:10:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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-16 23:10:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 81 transitions. [2025-03-16 23:10:50,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 81 transitions. Word has length 121 [2025-03-16 23:10:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:50,897 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 81 transitions. [2025-03-16 23:10:50,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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-16 23:10:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2025-03-16 23:10:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 23:10:50,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:50,898 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] [2025-03-16 23:10:50,908 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-16 23:10:51,100 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-16 23:10:51,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2089111535, now seen corresponding path program 1 times [2025-03-16 23:10:51,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:10:51,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601284310] [2025-03-16 23:10:51,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:51,101 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-16 23:10:51,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:10:51,103 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-16 23:10:51,104 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-16 23:10:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 23:10:51,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 23:10:51,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:51,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:51,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:10:51,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:10:51,343 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-16 23:10:51,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:10:51,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:10:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601284310] [2025-03-16 23:10:51,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601284310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:10:51,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:10:51,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:10:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339121421] [2025-03-16 23:10:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:10:51,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:10:51,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:10:51,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:10:51,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:10:51,345 INFO L87 Difference]: Start difference. First operand 52 states and 81 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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-16 23:10:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:10:51,767 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2025-03-16 23:10:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:10:51,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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 121 [2025-03-16 23:10:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:10:51,769 INFO L225 Difference]: With dead ends: 123 [2025-03-16 23:10:51,769 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 23:10:51,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-16 23:10:51,770 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 26 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:10:51,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 146 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:10:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 23:10:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-16 23:10:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 23:10:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2025-03-16 23:10:51,779 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 121 [2025-03-16 23:10:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:10:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2025-03-16 23:10:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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-16 23:10:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2025-03-16 23:10:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 23:10:51,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:10:51,784 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] [2025-03-16 23:10:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:10:51,984 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-16 23:10:51,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:10:51,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:10:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -918698254, now seen corresponding path program 1 times [2025-03-16 23:10:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:10:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337742755] [2025-03-16 23:10:51,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:10:51,985 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-16 23:10:51,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:10:51,988 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-16 23:10:51,989 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-16 23:10:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 23:10:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 23:10:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:10:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:10:52,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 23:10:52,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:10:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-16 23:10:53,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:11:16,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:11:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337742755] [2025-03-16 23:11:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337742755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:11:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [610134450] [2025-03-16 23:11:16,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:11:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 23:11:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 23:11:16,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 23:11:16,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-16 23:11:16,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 23:11:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 23:11:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:11:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:11:17,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 23:11:17,116 INFO L279 TraceCheckSpWp]: Computing forward predicates...