./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.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_floatingpointinfluence_no-floats_file-55.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:56:09,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:56:09,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:56:09,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:56:09,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:56:09,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:56:09,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:56:09,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:56:09,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:56:09,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:56:09,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:56:09,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:56:09,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:56:09,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:56:09,373 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:56:09,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:56:09,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:56:09,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:56:09,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:56:09,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:56:09,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:56:09,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:56:09,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:09,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:56:09,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:56:09,376 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2025-03-17 02:56:09,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:56:09,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:56:09,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:56:09,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:56:09,605 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:56:09,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:10,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b464138/240e79d1619e482399fc49147b717b2f/FLAG73685fb26 [2025-03-17 02:56:10,925 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:56:10,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:10,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b464138/240e79d1619e482399fc49147b717b2f/FLAG73685fb26 [2025-03-17 02:56:11,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b464138/240e79d1619e482399fc49147b717b2f [2025-03-17 02:56:11,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:56:11,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:56:11,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:11,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:56:11,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:56:11,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef2cdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11, skipping insertion in model container [2025-03-17 02:56:11,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:56:11,395 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_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-03-17 02:56:11,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:11,448 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:56:11,458 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_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-03-17 02:56:11,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:11,495 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:56:11,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11 WrapperNode [2025-03-17 02:56:11,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:11,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:11,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:56:11,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:56:11,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,534 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-03-17 02:56:11,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:11,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:56:11,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:56:11,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:56:11,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,555 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-17 02:56:11,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:56:11,571 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:56:11,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:56:11,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:56:11,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (1/1) ... [2025-03-17 02:56:11,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:11,601 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-17 02:56:11,606 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-17 02:56:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:56:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:56:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:56:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:56:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:56:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:56:11,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:56:11,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:56:11,976 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-03-17 02:56:12,119 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 02:56:12,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:56:12,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:56:12,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:56:12,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:12 BoogieIcfgContainer [2025-03-17 02:56:12,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:56:12,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:56:12,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:56:12,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:56:12,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:11" (1/3) ... [2025-03-17 02:56:12,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3df12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:12, skipping insertion in model container [2025-03-17 02:56:12,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:11" (2/3) ... [2025-03-17 02:56:12,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3df12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:12, skipping insertion in model container [2025-03-17 02:56:12,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:12" (3/3) ... [2025-03-17 02:56:12,141 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:12,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:56:12,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-55.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:56:12,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:56:12,213 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;@1207e84b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:56:12,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:56:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 02:56:12,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:12,229 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:12,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:12,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1619551438, now seen corresponding path program 1 times [2025-03-17 02:56:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633215221] [2025-03-17 02:56:12,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:12,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:56:12,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:56:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:12,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:56:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633215221] [2025-03-17 02:56:12,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633215221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:12,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515517443] [2025-03-17 02:56:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:12,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:12,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:12,426 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-17 02:56:12,428 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-17 02:56:12,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:56:12,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:56:12,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:12,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:12,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:56:12,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:56:12,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515517443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:56:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:56:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439163042] [2025-03-17 02:56:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:56:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:12,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:56:12,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:56:12,588 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:56:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:12,614 INFO L93 Difference]: Finished difference Result 119 states and 196 transitions. [2025-03-17 02:56:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:56:12,616 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-17 02:56:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:12,621 INFO L225 Difference]: With dead ends: 119 [2025-03-17 02:56:12,623 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 02:56:12,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-17 02:56:12,628 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:12,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 02:56:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 02:56:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2025-03-17 02:56:12,657 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 103 [2025-03-17 02:56:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2025-03-17 02:56:12,657 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:56:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2025-03-17 02:56:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 02:56:12,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:12,662 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:12,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:56:12,866 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-17 02:56:12,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:12,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 743115570, now seen corresponding path program 1 times [2025-03-17 02:56:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758262960] [2025-03-17 02:56:12,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:12,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:56:12,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:56:12,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:12,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758262960] [2025-03-17 02:56:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758262960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:13,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:13,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228489463] [2025-03-17 02:56:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:13,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:13,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:13,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:13,032 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:13,063 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2025-03-17 02:56:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-17 02:56:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:13,064 INFO L225 Difference]: With dead ends: 144 [2025-03-17 02:56:13,065 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 02:56:13,065 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-17 02:56:13,066 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:13,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 156 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 02:56:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2025-03-17 02:56:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-03-17 02:56:13,072 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 103 [2025-03-17 02:56:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-03-17 02:56:13,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-03-17 02:56:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 02:56:13,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:13,075 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:56:13,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 872198289, now seen corresponding path program 1 times [2025-03-17 02:56:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870300098] [2025-03-17 02:56:13,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:13,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 02:56:13,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 02:56:13,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870300098] [2025-03-17 02:56:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870300098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99836506] [2025-03-17 02:56:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:13,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:13,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:13,224 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:13,268 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2025-03-17 02:56:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-17 02:56:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:13,272 INFO L225 Difference]: With dead ends: 119 [2025-03-17 02:56:13,272 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 02:56:13,272 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-17 02:56:13,273 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:13,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 02:56:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 02:56:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2025-03-17 02:56:13,281 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 103 [2025-03-17 02:56:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:13,281 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2025-03-17 02:56:13,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2025-03-17 02:56:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 02:56:13,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:13,283 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:56:13,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1465979441, now seen corresponding path program 1 times [2025-03-17 02:56:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996434666] [2025-03-17 02:56:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:13,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 02:56:13,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 02:56:13,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:13,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996434666] [2025-03-17 02:56:13,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996434666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:13,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:13,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:56:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337717208] [2025-03-17 02:56:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:56:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:13,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:56:13,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:56:13,621 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:13,817 INFO L93 Difference]: Finished difference Result 179 states and 260 transitions. [2025-03-17 02:56:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:56:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2025-03-17 02:56:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:13,820 INFO L225 Difference]: With dead ends: 179 [2025-03-17 02:56:13,821 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 02:56:13,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:56:13,822 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 103 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:13,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 269 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 02:56:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-03-17 02:56:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 02:56:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-17 02:56:13,848 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 105 [2025-03-17 02:56:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:13,849 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-17 02:56:13,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-17 02:56:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 02:56:13,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:13,850 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:56:13,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1862165064, now seen corresponding path program 1 times [2025-03-17 02:56:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329108713] [2025-03-17 02:56:13,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:13,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 02:56:13,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 02:56:13,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:14,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329108713] [2025-03-17 02:56:14,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329108713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:14,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:14,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:56:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149943796] [2025-03-17 02:56:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:14,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:56:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:14,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:56:14,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:56:14,219 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:14,308 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2025-03-17 02:56:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:56:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-17 02:56:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:14,311 INFO L225 Difference]: With dead ends: 211 [2025-03-17 02:56:14,312 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 02:56:14,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:56:14,314 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 23 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:14,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 196 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:56:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 02:56:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2025-03-17 02:56:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 99 states have internal predecessors, (126), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 02:56:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2025-03-17 02:56:14,335 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 107 [2025-03-17 02:56:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:14,335 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2025-03-17 02:56:14,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2025-03-17 02:56:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 02:56:14,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:14,336 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:56:14,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1127023103, now seen corresponding path program 1 times [2025-03-17 02:56:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444346489] [2025-03-17 02:56:14,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:14,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 02:56:14,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 02:56:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444346489] [2025-03-17 02:56:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444346489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:56:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334666946] [2025-03-17 02:56:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:56:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:15,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:56:15,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:56:15,405 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:56:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:15,790 INFO L93 Difference]: Finished difference Result 368 states and 507 transitions. [2025-03-17 02:56:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:56:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-03-17 02:56:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:15,792 INFO L225 Difference]: With dead ends: 368 [2025-03-17 02:56:15,792 INFO L226 Difference]: Without dead ends: 281 [2025-03-17 02:56:15,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:56:15,793 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 216 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:15,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 475 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:56:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-17 02:56:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 185. [2025-03-17 02:56:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 133 states have (on average 1.263157894736842) internal successors, (168), 133 states have internal predecessors, (168), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:56:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2025-03-17 02:56:15,820 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 108 [2025-03-17 02:56:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:15,820 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2025-03-17 02:56:15,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:56:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2025-03-17 02:56:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 02:56:15,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:15,821 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:56:15,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:15,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash -650140802, now seen corresponding path program 1 times [2025-03-17 02:56:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:15,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660421213] [2025-03-17 02:56:15,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:15,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 02:56:15,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 02:56:15,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:15,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660421213] [2025-03-17 02:56:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660421213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820352031] [2025-03-17 02:56:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:15,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:15,880 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:15,913 INFO L93 Difference]: Finished difference Result 315 states and 453 transitions. [2025-03-17 02:56:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2025-03-17 02:56:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:15,914 INFO L225 Difference]: With dead ends: 315 [2025-03-17 02:56:15,914 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 02:56:15,915 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-17 02:56:15,915 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:15,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 02:56:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-17 02:56:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 135 states have internal predecessors, (168), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:56:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 264 transitions. [2025-03-17 02:56:15,926 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 264 transitions. Word has length 111 [2025-03-17 02:56:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:15,926 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 264 transitions. [2025-03-17 02:56:15,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 264 transitions. [2025-03-17 02:56:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 02:56:15,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:15,927 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:56:15,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1765490970, now seen corresponding path program 1 times [2025-03-17 02:56:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743397916] [2025-03-17 02:56:15,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:15,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 02:56:15,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 02:56:15,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:15,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:56:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743397916] [2025-03-17 02:56:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743397916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593677011] [2025-03-17 02:56:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:16,961 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-17 02:56:16,963 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-17 02:56:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 02:56:17,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 02:56:17,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:17,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:17,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 02:56:17,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 294 proven. 45 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-17 02:56:18,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:56:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:56:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593677011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:56:20,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:56:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 12] total 33 [2025-03-17 02:56:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725686091] [2025-03-17 02:56:20,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:56:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 02:56:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:20,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 02:56:20,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 02:56:20,144 INFO L87 Difference]: Start difference. First operand 187 states and 264 transitions. Second operand has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 5 states have call successors, (31), 3 states have call predecessors, (31), 7 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2025-03-17 02:56:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:21,537 INFO L93 Difference]: Finished difference Result 397 states and 499 transitions. [2025-03-17 02:56:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 02:56:21,538 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 5 states have call successors, (31), 3 states have call predecessors, (31), 7 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) Word has length 114 [2025-03-17 02:56:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:21,540 INFO L225 Difference]: With dead ends: 397 [2025-03-17 02:56:21,540 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 02:56:21,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=749, Invalid=2557, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 02:56:21,542 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 506 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:21,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 510 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:56:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 02:56:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 240. [2025-03-17 02:56:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 180 states have (on average 1.2055555555555555) internal successors, (217), 180 states have internal predecessors, (217), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:56:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 313 transitions. [2025-03-17 02:56:21,560 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 313 transitions. Word has length 114 [2025-03-17 02:56:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:21,560 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 313 transitions. [2025-03-17 02:56:21,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 5 states have call successors, (31), 3 states have call predecessors, (31), 7 states have return successors, (33), 6 states have call predecessors, (33), 5 states have call successors, (33) [2025-03-17 02:56:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 313 transitions. [2025-03-17 02:56:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 02:56:21,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:21,561 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:21,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:56:21,765 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,SelfDestructingSolverStorable7 [2025-03-17 02:56:21,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:21,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1423479336, now seen corresponding path program 1 times [2025-03-17 02:56:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069169181] [2025-03-17 02:56:21,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:21,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:56:21,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:56:21,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:56:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069169181] [2025-03-17 02:56:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069169181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100218232] [2025-03-17 02:56:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:21,892 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-17 02:56:21,893 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-17 02:56:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:56:21,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:56:21,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:21,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:21,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:56:21,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 02:56:22,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:56:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 02:56:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100218232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:56:22,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:56:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-03-17 02:56:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483503562] [2025-03-17 02:56:22,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:56:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 02:56:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:22,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 02:56:22,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:56:22,163 INFO L87 Difference]: Start difference. First operand 240 states and 313 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 02:56:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:22,500 INFO L93 Difference]: Finished difference Result 541 states and 710 transitions. [2025-03-17 02:56:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:56:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 115 [2025-03-17 02:56:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:22,503 INFO L225 Difference]: With dead ends: 541 [2025-03-17 02:56:22,503 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 02:56:22,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:56:22,504 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 235 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:22,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 255 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 02:56:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 251. [2025-03-17 02:56:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 191 states have (on average 1.198952879581152) internal successors, (229), 191 states have internal predecessors, (229), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:56:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 325 transitions. [2025-03-17 02:56:22,525 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 325 transitions. Word has length 115 [2025-03-17 02:56:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:22,525 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 325 transitions. [2025-03-17 02:56:22,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 02:56:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 325 transitions. [2025-03-17 02:56:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 02:56:22,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:22,527 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:22,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 02:56:22,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:22,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:22,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 917920711, now seen corresponding path program 1 times [2025-03-17 02:56:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147274012] [2025-03-17 02:56:22,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:22,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:56:22,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:56:22,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:22,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:56:22,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:56:22,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 02:56:22,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 02:56:22,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:22,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:56:22,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:56:22,802 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:56:22,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:56:22,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:56:22,806 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:22,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:56:22,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:56:22 BoogieIcfgContainer [2025-03-17 02:56:22,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:56:22,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:56:22,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:56:22,887 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:56:22,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:12" (3/4) ... [2025-03-17 02:56:22,901 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:56:22,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:56:22,902 INFO L158 Benchmark]: Toolchain (without parser) took 11635.06ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 132.1MB in the beginning and 525.0MB in the end (delta: -392.9MB). Peak memory consumption was 328.1MB. Max. memory is 16.1GB. [2025-03-17 02:56:22,902 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:56:22,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.57ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 119.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:56:22,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.06ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:56:22,902 INFO L158 Benchmark]: Boogie Preprocessor took 36.06ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 114.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:56:22,903 INFO L158 Benchmark]: IcfgBuilder took 562.24ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 94.9MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:56:22,903 INFO L158 Benchmark]: TraceAbstraction took 10750.81ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 94.5MB in the beginning and 202.5MB in the end (delta: -108.0MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2025-03-17 02:56:22,903 INFO L158 Benchmark]: Witness Printer took 14.70ms. Allocated memory is still 562.0MB. Free memory was 202.5MB in the beginning and 525.0MB in the end (delta: -322.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-03-17 02:56:22,904 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.57ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 119.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.06ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.06ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 114.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 562.24ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 94.9MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10750.81ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 94.5MB in the beginning and 202.5MB in the end (delta: -108.0MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. * Witness Printer took 14.70ms. Allocated memory is still 562.0MB. Free memory was 202.5MB in the beginning and 525.0MB in the end (delta: -322.5MB). Peak memory consumption was 8.7MB. 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 shiftRight at line 60, overapproximation of shiftRight at line 60, overapproximation of shiftRight at line 101, overapproximation of shiftRight at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-5, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-252, var_1_18=-252, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 107 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1158 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1118 mSDsluCounter, 2229 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1527 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1790 IncrementalHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 702 mSDtfsCounter, 1790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 555 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 9 MinimizatonAttempts, 420 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 5593 SizeOfPredicates, 29 NumberOfNonLiveVariables, 795 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 6600/6720 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-17 02:56:22,922 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_floatingpointinfluence_no-floats_file-55.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:56:24,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:56:24,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:56:24,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:56:24,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:56:24,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:56:24,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:56:24,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:56:24,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:56:24,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:56:24,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:56:24,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:56:24,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:56:24,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:56:24,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:56:24,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:24,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:56:24,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:56:24,856 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2025-03-17 02:56:25,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:56:25,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:56:25,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:56:25,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:56:25,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:56:25,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:26,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245790c3b/f7945af28ddc4b6cb4fdcb16dbcddf78/FLAGa01c6ad9b [2025-03-17 02:56:26,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:56:26,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:26,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245790c3b/f7945af28ddc4b6cb4fdcb16dbcddf78/FLAGa01c6ad9b [2025-03-17 02:56:26,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245790c3b/f7945af28ddc4b6cb4fdcb16dbcddf78 [2025-03-17 02:56:26,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:56:26,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:56:26,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:26,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:56:26,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:56:26,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:26,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c61894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26, skipping insertion in model container [2025-03-17 02:56:26,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:26,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:56:26,906 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_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-03-17 02:56:26,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:26,938 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:56:26,946 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_floatingpointinfluence_no-floats_file-55.i[916,929] [2025-03-17 02:56:26,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:56:26,977 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:56:26,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26 WrapperNode [2025-03-17 02:56:26,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:56:26,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:26,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:56:26,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:56:26,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:26,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,013 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 02:56:27,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:56:27,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:56:27,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:56:27,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:56:27,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,039 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-17 02:56:27,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:56:27,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:56:27,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:56:27,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:56:27,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (1/1) ... [2025-03-17 02:56:27,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:56:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:27,089 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-17 02:56:27,091 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-17 02:56:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:56:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:56:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:56:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:56:27,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:56:27,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:56:27,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:56:27,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:56:27,353 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:56:27,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:56:27,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:56:27,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:56:27,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:27 BoogieIcfgContainer [2025-03-17 02:56:27,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:56:27,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:56:27,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:56:27,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:56:27,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:56:26" (1/3) ... [2025-03-17 02:56:27,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7e680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:27, skipping insertion in model container [2025-03-17 02:56:27,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:56:26" (2/3) ... [2025-03-17 02:56:27,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7e680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:56:27, skipping insertion in model container [2025-03-17 02:56:27,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:56:27" (3/3) ... [2025-03-17 02:56:27,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2025-03-17 02:56:27,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:56:27,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-55.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:56:27,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:56:27,431 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;@80b5d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:56:27,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:56:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 02:56:27,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:27,456 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:27,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1032429465, now seen corresponding path program 1 times [2025-03-17 02:56:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:56:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662522330] [2025-03-17 02:56:27,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:27,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:27,469 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-17 02:56:27,470 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-17 02:56:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 02:56:27,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 02:56:27,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:27,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:27,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:56:27,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:27,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:27,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:56:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662522330] [2025-03-17 02:56:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662522330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:56:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484367326] [2025-03-17 02:56:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:56:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:56:27,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:56:27,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:27,646 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:27,688 INFO L93 Difference]: Finished difference Result 95 states and 163 transitions. [2025-03-17 02:56:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:56:27,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2025-03-17 02:56:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:27,694 INFO L225 Difference]: With dead ends: 95 [2025-03-17 02:56:27,694 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 02:56:27,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:56:27,698 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:27,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:56:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 02:56:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-03-17 02:56:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:56:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 02:56:27,724 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 97 [2025-03-17 02:56:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:27,725 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 02:56:27,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 02:56:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 02:56:27,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:27,727 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:27,735 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-17 02:56:27,928 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 [2025-03-17 02:56:27,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1061058616, now seen corresponding path program 1 times [2025-03-17 02:56:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:56:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560230413] [2025-03-17 02:56:27,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:27,931 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-17 02:56:27,933 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-17 02:56:27,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 02:56:28,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 02:56:28,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:28,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 02:56:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:56:28,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:56:28,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:56:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560230413] [2025-03-17 02:56:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560230413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:28,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:28,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:56:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305442188] [2025-03-17 02:56:28,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:28,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:56:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:56:28,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:56:28,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:56:28,244 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:28,419 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2025-03-17 02:56:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:56:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2025-03-17 02:56:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:28,423 INFO L225 Difference]: With dead ends: 179 [2025-03-17 02:56:28,424 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 02:56:28,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:56:28,426 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 117 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:28,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 384 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:56:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 02:56:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2025-03-17 02:56:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:56:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2025-03-17 02:56:28,446 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 97 [2025-03-17 02:56:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:28,446 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2025-03-17 02:56:28,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:56:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2025-03-17 02:56:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:56:28,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:28,449 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:56:28,456 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-17 02:56:28,654 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 [2025-03-17 02:56:28,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1465966004, now seen corresponding path program 1 times [2025-03-17 02:56:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:56:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951976583] [2025-03-17 02:56:28,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:28,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:28,657 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-17 02:56:28,658 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-17 02:56:28,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:56:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:56:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:28,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 02:56:28,734 INFO L279 TraceCheckSpWp]: Computing forward predicates...