./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-34.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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:12:08,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:12:08,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:12:08,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:12:08,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:12:08,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:12:08,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:12:08,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:12:08,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:12:08,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:12:08,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:12:08,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:12:08,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:12:08,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:12:08,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:12:08,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:12:08,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:12:08,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:12:08,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:12:08,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:12:08,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:12:08,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:12:08,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:12:08,459 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2025-03-03 22:12:08,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:12:08,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:12:08,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:12:08,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:12:08,682 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:12:08,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-34.i [2025-03-03 22:12:09,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3011d7287/6203bbbb3af6450f9b77db9e11e0fb45/FLAGca6405537 [2025-03-03 22:12:10,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:12:10,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-34.i [2025-03-03 22:12:10,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3011d7287/6203bbbb3af6450f9b77db9e11e0fb45/FLAGca6405537 [2025-03-03 22:12:10,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3011d7287/6203bbbb3af6450f9b77db9e11e0fb45 [2025-03-03 22:12:10,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:12:10,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:12:10,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:12:10,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:12:10,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:12:10,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635ea320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10, skipping insertion in model container [2025-03-03 22:12:10,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:12:10,190 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_fillercode_fillercodestructure_normal_file-34.i[913,926] [2025-03-03 22:12:10,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:12:10,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:12:10,261 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_fillercode_fillercodestructure_normal_file-34.i[913,926] [2025-03-03 22:12:10,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:12:10,294 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:12:10,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10 WrapperNode [2025-03-03 22:12:10,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:12:10,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:12:10,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:12:10,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:12:10,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,331 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-03 22:12:10,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:12:10,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:12:10,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:12:10,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:12:10,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,361 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:12:10,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:12:10,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:12:10,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:12:10,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:12:10,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (1/1) ... [2025-03-03 22:12:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:12:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:12:10,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:12:10,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:12:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:12:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:12:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:12:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:12:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:12:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:12:10,487 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:12:10,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:12:10,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-03 22:12:10,762 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 22:12:10,762 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:12:10,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:12:10,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:12:10,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:12:10 BoogieIcfgContainer [2025-03-03 22:12:10,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:12:10,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:12:10,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:12:10,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:12:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:12:10" (1/3) ... [2025-03-03 22:12:10,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6490e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:12:10, skipping insertion in model container [2025-03-03 22:12:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:12:10" (2/3) ... [2025-03-03 22:12:10,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6490e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:12:10, skipping insertion in model container [2025-03-03 22:12:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:12:10" (3/3) ... [2025-03-03 22:12:10,792 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-34.i [2025-03-03 22:12:10,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:12:10,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-34.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:12:10,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:12:10,855 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;@42a03a5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:12:10,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:12:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:12:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:12:10,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:10,867 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:10,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:10,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -651424101, now seen corresponding path program 1 times [2025-03-03 22:12:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577774963] [2025-03-03 22:12:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:10,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:12:10,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:12:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 22:12:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577774963] [2025-03-03 22:12:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577774963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:12:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754156759] [2025-03-03 22:12:11,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:11,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:12:11,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:12:11,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:12:11,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:12:11,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:12:11,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:12:11,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:11,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:12:11,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:12:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 22:12:11,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:12:11,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754156759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:11,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:12:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:12:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746634233] [2025-03-03 22:12:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:11,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:12:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:11,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:12:11,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:12:11,270 INFO L87 Difference]: Start difference. First operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:12:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:11,301 INFO L93 Difference]: Finished difference Result 134 states and 220 transitions. [2025-03-03 22:12:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:12:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-03-03 22:12:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:11,308 INFO L225 Difference]: With dead ends: 134 [2025-03-03 22:12:11,310 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 22:12:11,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:12:11,314 INFO L435 NwaCegarLoop]: 97 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, 97 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-03 22:12:11,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:12:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 22:12:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 22:12:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 22:12:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 22:12:11,341 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2025-03-03 22:12:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 22:12:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:12:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 22:12:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 22:12:11,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:11,344 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:11,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:12:11,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:12:11,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:11,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1432194012, now seen corresponding path program 1 times [2025-03-03 22:12:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648275724] [2025-03-03 22:12:11,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:11,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 22:12:11,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 22:12:11,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648275724] [2025-03-03 22:12:11,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648275724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:11,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:11,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:12:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636283382] [2025-03-03 22:12:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:11,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:12:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:11,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:12:11,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:12:11,930 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:12,052 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2025-03-03 22:12:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:12:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-03 22:12:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:12,055 INFO L225 Difference]: With dead ends: 225 [2025-03-03 22:12:12,056 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 22:12:12,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:12:12,057 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 129 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:12:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 22:12:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2025-03-03 22:12:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:12:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-03 22:12:12,080 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2025-03-03 22:12:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:12,080 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-03 22:12:12,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-03 22:12:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:12:12,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:12,084 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:12,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:12:12,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 591507331, now seen corresponding path program 1 times [2025-03-03 22:12:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554182970] [2025-03-03 22:12:12,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:12,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:12:12,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:12:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:12,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554182970] [2025-03-03 22:12:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554182970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:12,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:12,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:12:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67705636] [2025-03-03 22:12:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:12,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:12:12,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:12,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:12:12,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:12:12,272 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:12,468 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2025-03-03 22:12:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:12:12,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-03-03 22:12:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:12,470 INFO L225 Difference]: With dead ends: 382 [2025-03-03 22:12:12,472 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 22:12:12,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:12:12,473 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 134 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:12,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 384 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:12:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 22:12:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2025-03-03 22:12:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 22:12:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2025-03-03 22:12:12,490 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2025-03-03 22:12:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2025-03-03 22:12:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2025-03-03 22:12:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:12,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:12,492 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:12:12,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1218992728, now seen corresponding path program 1 times [2025-03-03 22:12:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822146349] [2025-03-03 22:12:12,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:12,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:12,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822146349] [2025-03-03 22:12:12,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822146349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:12,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:12,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:12:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854713020] [2025-03-03 22:12:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:12:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:12,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:12:12,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:12:12,879 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:13,090 INFO L93 Difference]: Finished difference Result 364 states and 547 transitions. [2025-03-03 22:12:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:12:13,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 22:12:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:13,094 INFO L225 Difference]: With dead ends: 364 [2025-03-03 22:12:13,094 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 22:12:13,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:12:13,095 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:13,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 228 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:12:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 22:12:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 176. [2025-03-03 22:12:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 264 transitions. [2025-03-03 22:12:13,120 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 264 transitions. Word has length 96 [2025-03-03 22:12:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:13,120 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 264 transitions. [2025-03-03 22:12:13,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 264 transitions. [2025-03-03 22:12:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:13,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:13,121 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:12:13,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1724551353, now seen corresponding path program 1 times [2025-03-03 22:12:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361670923] [2025-03-03 22:12:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:13,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:13,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:14,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361670923] [2025-03-03 22:12:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361670923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:12:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055224562] [2025-03-03 22:12:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:12:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:14,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:12:14,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:12:14,450 INFO L87 Difference]: Start difference. First operand 176 states and 264 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:14,832 INFO L93 Difference]: Finished difference Result 372 states and 557 transitions. [2025-03-03 22:12:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:12:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 22:12:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:14,834 INFO L225 Difference]: With dead ends: 372 [2025-03-03 22:12:14,835 INFO L226 Difference]: Without dead ends: 240 [2025-03-03 22:12:14,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:12:14,836 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 148 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:14,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 287 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:12:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-03 22:12:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 182. [2025-03-03 22:12:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 139 states have (on average 1.39568345323741) internal successors, (194), 139 states have internal predecessors, (194), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 272 transitions. [2025-03-03 22:12:14,868 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 272 transitions. Word has length 96 [2025-03-03 22:12:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:14,868 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 272 transitions. [2025-03-03 22:12:14,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2025-03-03 22:12:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:14,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:14,870 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:14,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:12:14,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash 174976660, now seen corresponding path program 1 times [2025-03-03 22:12:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297926523] [2025-03-03 22:12:14,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:14,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:14,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:14,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297926523] [2025-03-03 22:12:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297926523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:12:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103646122] [2025-03-03 22:12:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:22,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:12:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:22,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:12:22,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:12:22,923 INFO L87 Difference]: Start difference. First operand 182 states and 272 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:24,580 INFO L93 Difference]: Finished difference Result 522 states and 758 transitions. [2025-03-03 22:12:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:12:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 22:12:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:24,582 INFO L225 Difference]: With dead ends: 522 [2025-03-03 22:12:24,582 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 22:12:24,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:12:24,584 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 457 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:24,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 545 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:12:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 22:12:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 248. [2025-03-03 22:12:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.395121951219512) internal successors, (286), 205 states have internal predecessors, (286), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2025-03-03 22:12:24,602 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 96 [2025-03-03 22:12:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:24,602 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2025-03-03 22:12:24,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2025-03-03 22:12:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:24,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:24,604 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:24,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:12:24,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:24,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1062480341, now seen corresponding path program 1 times [2025-03-03 22:12:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:24,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202991717] [2025-03-03 22:12:24,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:24,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:24,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:24,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:24,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202991717] [2025-03-03 22:12:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202991717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:12:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58716627] [2025-03-03 22:12:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:12:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:26,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:12:26,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:12:26,182 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:27,014 INFO L93 Difference]: Finished difference Result 551 states and 810 transitions. [2025-03-03 22:12:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:12:27,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 22:12:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:27,016 INFO L225 Difference]: With dead ends: 551 [2025-03-03 22:12:27,016 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 22:12:27,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:12:27,017 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 301 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:27,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 392 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:12:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 22:12:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 289. [2025-03-03 22:12:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 246 states have (on average 1.3780487804878048) internal successors, (339), 246 states have internal predecessors, (339), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2025-03-03 22:12:27,042 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 417 transitions. Word has length 96 [2025-03-03 22:12:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:27,043 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 417 transitions. [2025-03-03 22:12:27,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 417 transitions. [2025-03-03 22:12:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:27,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:27,045 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:27,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:12:27,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1632477803, now seen corresponding path program 1 times [2025-03-03 22:12:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879129562] [2025-03-03 22:12:27,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:27,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:27,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879129562] [2025-03-03 22:12:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879129562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:12:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020568938] [2025-03-03 22:12:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:12:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:12:28,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:12:28,098 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:12:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:28,912 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2025-03-03 22:12:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:12:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2025-03-03 22:12:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:28,918 INFO L225 Difference]: With dead ends: 569 [2025-03-03 22:12:28,919 INFO L226 Difference]: Without dead ends: 423 [2025-03-03 22:12:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 22:12:28,920 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 349 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:28,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 409 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:12:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-03 22:12:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2025-03-03 22:12:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.396551724137931) internal successors, (405), 290 states have internal predecessors, (405), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 483 transitions. [2025-03-03 22:12:28,946 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 483 transitions. Word has length 96 [2025-03-03 22:12:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:28,947 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 483 transitions. [2025-03-03 22:12:28,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 22:12:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 483 transitions. [2025-03-03 22:12:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 22:12:28,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:28,948 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:28,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:12:28,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:28,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash -335557517, now seen corresponding path program 1 times [2025-03-03 22:12:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:28,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750241217] [2025-03-03 22:12:28,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:28,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:28,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 22:12:28,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 22:12:28,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:28,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:12:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:12:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:12:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750241217] [2025-03-03 22:12:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750241217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:12:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:12:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 22:12:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047019106] [2025-03-03 22:12:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:12:55,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 22:12:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:12:55,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 22:12:55,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-03 22:12:55,263 INFO L87 Difference]: Start difference. First operand 333 states and 483 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:12:57,034 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2025-03-03 22:12:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:12:57,034 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-03 22:12:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:12:57,036 INFO L225 Difference]: With dead ends: 457 [2025-03-03 22:12:57,036 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 22:12:57,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:12:57,037 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 270 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:12:57,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 852 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:12:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 22:12:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 322. [2025-03-03 22:12:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 22:12:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2025-03-03 22:12:57,057 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2025-03-03 22:12:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:12:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2025-03-03 22:12:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:12:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2025-03-03 22:12:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:12:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:12:57,059 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:12:57,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:12:57,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:12:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:12:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1540719902, now seen corresponding path program 1 times [2025-03-03 22:12:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:12:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433410430] [2025-03-03 22:12:57,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:12:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:12:57,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:12:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:12:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:12:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:13:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:13:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:13:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433410430] [2025-03-03 22:13:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433410430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:13:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:13:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:13:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184874610] [2025-03-03 22:13:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:13:18,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:13:18,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:13:18,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:13:18,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:13:18,103 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:13:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:13:18,543 INFO L93 Difference]: Finished difference Result 772 states and 1117 transitions. [2025-03-03 22:13:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:13:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-03-03 22:13:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:13:18,546 INFO L225 Difference]: With dead ends: 772 [2025-03-03 22:13:18,546 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 22:13:18,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:13:18,547 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 261 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:13:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 704 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 22:13:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 22:13:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 474. [2025-03-03 22:13:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 424 states have (on average 1.3891509433962264) internal successors, (589), 425 states have internal predecessors, (589), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 22:13:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 677 transitions. [2025-03-03 22:13:18,567 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 677 transitions. Word has length 97 [2025-03-03 22:13:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:13:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 677 transitions. [2025-03-03 22:13:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:13:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 677 transitions. [2025-03-03 22:13:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:13:18,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:13:18,568 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:13:18,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:13:18,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:13:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:13:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1400937697, now seen corresponding path program 1 times [2025-03-03 22:13:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:13:18,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275372621] [2025-03-03 22:13:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:13:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:13:18,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:13:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:13:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:13:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:13:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 22:13:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:13:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275372621] [2025-03-03 22:13:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275372621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:13:39,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:13:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:13:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240630520] [2025-03-03 22:13:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:13:39,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:13:39,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:13:39,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:13:39,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:13:39,539 INFO L87 Difference]: Start difference. First operand 474 states and 677 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:13:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:13:40,071 INFO L93 Difference]: Finished difference Result 739 states and 1062 transitions. [2025-03-03 22:13:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:13:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-03-03 22:13:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:13:40,074 INFO L225 Difference]: With dead ends: 739 [2025-03-03 22:13:40,074 INFO L226 Difference]: Without dead ends: 623 [2025-03-03 22:13:40,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:13:40,075 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 233 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:13:40,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1129 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:13:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-03 22:13:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 522. [2025-03-03 22:13:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 463 states have (on average 1.3844492440604752) internal successors, (641), 463 states have internal predecessors, (641), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 22:13:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 745 transitions. [2025-03-03 22:13:40,105 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 745 transitions. Word has length 97 [2025-03-03 22:13:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:13:40,106 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 745 transitions. [2025-03-03 22:13:40,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 22:13:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 745 transitions. [2025-03-03 22:13:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 22:13:40,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:13:40,110 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:13:40,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 22:13:40,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:13:40,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:13:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2009973688, now seen corresponding path program 1 times [2025-03-03 22:13:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:13:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731085474] [2025-03-03 22:13:40,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:13:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:13:40,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 22:13:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 22:13:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:13:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat