./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.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 5210195513b04a67efdbde16013e554cd917c380644440c8ab9e15436a32073d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:46:00,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:46:00,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:46:00,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:46:00,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:46:00,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:46:00,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:46:00,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:46:00,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:46:00,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:46:00,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:46:00,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:46:00,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:46:00,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:46:00,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:46:00,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:46:00,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:46:00,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:46:00,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:46:00,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:46:00,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:46:00,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:46:00,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:46:00,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:46:00,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:46:00,903 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 -> 5210195513b04a67efdbde16013e554cd917c380644440c8ab9e15436a32073d [2025-03-16 23:46:01,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:46:01,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:46:01,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:46:01,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:46:01,130 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:46:01,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-16 23:46:02,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c80c08c/b115c211175949048bf9852655cd7033/FLAG947519961 [2025-03-16 23:46:02,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:46:02,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-16 23:46:02,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c80c08c/b115c211175949048bf9852655cd7033/FLAG947519961 [2025-03-16 23:46:02,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c80c08c/b115c211175949048bf9852655cd7033 [2025-03-16 23:46:02,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:46:02,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:46:02,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:46:02,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:46:02,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:46:02,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:46:02" (1/1) ... [2025-03-16 23:46:02,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:02, skipping insertion in model container [2025-03-16 23:46:02,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:46:02" (1/1) ... [2025-03-16 23:46:02,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:46:02,910 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_fillercodesize_ps-cn-100_file-66.i[916,929] [2025-03-16 23:46:02,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:46:02,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:46:02,983 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_fillercodesize_ps-cn-100_file-66.i[916,929] [2025-03-16 23:46:03,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:46:03,026 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:46:03,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03 WrapperNode [2025-03-16 23:46:03,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:46:03,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:46:03,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:46:03,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:46:03,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,082 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2025-03-16 23:46:03,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:46:03,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:46:03,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:46:03,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:46:03,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:46:03,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:46:03,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:46:03,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:46:03,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:46:03,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (1/1) ... [2025-03-16 23:46:03,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:46:03,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:46:03,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:46:03,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:46:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:46:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:46:03,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:46:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:46:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:46:03,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:46:03,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:46:03,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:46:03,619 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 23:46:03,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:46:03,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:46:03,634 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:46:03,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:46:03 BoogieIcfgContainer [2025-03-16 23:46:03,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:46:03,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:46:03,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:46:03,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:46:03,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:46:02" (1/3) ... [2025-03-16 23:46:03,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da95e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:46:03, skipping insertion in model container [2025-03-16 23:46:03,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:46:03" (2/3) ... [2025-03-16 23:46:03,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da95e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:46:03, skipping insertion in model container [2025-03-16 23:46:03,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:46:03" (3/3) ... [2025-03-16 23:46:03,642 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-66.i [2025-03-16 23:46:03,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:46:03,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-66.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:46:03,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:46:03,706 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;@78af9c63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:46:03,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:46:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-16 23:46:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:03,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:03,721 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:03,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:03,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash -633363871, now seen corresponding path program 1 times [2025-03-16 23:46:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997980549] [2025-03-16 23:46:03,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:03,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:03,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:03,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2025-03-16 23:46:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997980549] [2025-03-16 23:46:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997980549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:46:04,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370136023] [2025-03-16 23:46:04,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:04,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:46:04,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:46:04,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:46:04,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:46:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:04,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:04,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:04,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:04,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:46:04,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:46:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2025-03-16 23:46:04,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:46:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370136023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:46:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:46:04,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449622044] [2025-03-16 23:46:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:46:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:46:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:46:04,387 INFO L87 Difference]: Start difference. First operand has 133 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-16 23:46:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:04,414 INFO L93 Difference]: Finished difference Result 263 states and 489 transitions. [2025-03-16 23:46:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:46:04,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) Word has length 324 [2025-03-16 23:46:04,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:04,421 INFO L225 Difference]: With dead ends: 263 [2025-03-16 23:46:04,421 INFO L226 Difference]: Without dead ends: 131 [2025-03-16 23:46:04,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:46:04,426 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:46:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-16 23:46:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-16 23:46:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-16 23:46:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 215 transitions. [2025-03-16 23:46:04,460 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 215 transitions. Word has length 324 [2025-03-16 23:46:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:04,461 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 215 transitions. [2025-03-16 23:46:04,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-16 23:46:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 215 transitions. [2025-03-16 23:46:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:04,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:04,466 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:04,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:46:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:46:04,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1718084066, now seen corresponding path program 1 times [2025-03-16 23:46:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643268818] [2025-03-16 23:46:04,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643268818] [2025-03-16 23:46:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643268818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:09,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:46:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266751111] [2025-03-16 23:46:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:46:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:09,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:46:09,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:46:09,570 INFO L87 Difference]: Start difference. First operand 131 states and 215 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:10,382 INFO L93 Difference]: Finished difference Result 368 states and 579 transitions. [2025-03-16 23:46:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:46:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:10,385 INFO L225 Difference]: With dead ends: 368 [2025-03-16 23:46:10,385 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 23:46:10,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:46:10,387 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 150 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:10,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1314 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:46:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 23:46:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 173. [2025-03-16 23:46:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 114 states have internal predecessors, (164), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-16 23:46:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-03-16 23:46:10,410 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 324 [2025-03-16 23:46:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:10,411 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-03-16 23:46:10,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-03-16 23:46:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:10,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:10,413 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:10,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:46:10,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1718113857, now seen corresponding path program 1 times [2025-03-16 23:46:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360453377] [2025-03-16 23:46:10,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:10,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:10,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:10,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:10,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:14,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:14,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360453377] [2025-03-16 23:46:14,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360453377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:14,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:46:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078904867] [2025-03-16 23:46:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:14,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:46:14,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:14,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:46:14,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:46:14,624 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:15,593 INFO L93 Difference]: Finished difference Result 238 states and 357 transitions. [2025-03-16 23:46:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:46:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:15,598 INFO L225 Difference]: With dead ends: 238 [2025-03-16 23:46:15,600 INFO L226 Difference]: Without dead ends: 236 [2025-03-16 23:46:15,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:46:15,601 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 141 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:15,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1513 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:46:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-16 23:46:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 173. [2025-03-16 23:46:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 114 states have internal predecessors, (164), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-16 23:46:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-03-16 23:46:15,622 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 324 [2025-03-16 23:46:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:15,623 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-03-16 23:46:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-03-16 23:46:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:15,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:15,626 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:46:15,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash -834072895, now seen corresponding path program 1 times [2025-03-16 23:46:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872121607] [2025-03-16 23:46:15,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:18,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:18,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872121607] [2025-03-16 23:46:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872121607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:18,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:18,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:46:18,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828215790] [2025-03-16 23:46:18,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:18,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:46:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:18,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:46:18,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:46:18,719 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:19,273 INFO L93 Difference]: Finished difference Result 244 states and 364 transitions. [2025-03-16 23:46:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:46:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:19,275 INFO L225 Difference]: With dead ends: 244 [2025-03-16 23:46:19,276 INFO L226 Difference]: Without dead ends: 242 [2025-03-16 23:46:19,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:46:19,276 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 163 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:19,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1180 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:46:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-16 23:46:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 177. [2025-03-16 23:46:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 117 states have (on average 1.452991452991453) internal successors, (170), 118 states have internal predecessors, (170), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-16 23:46:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2025-03-16 23:46:19,291 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 324 [2025-03-16 23:46:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2025-03-16 23:46:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2025-03-16 23:46:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:19,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:19,296 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:19,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:46:19,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -834043104, now seen corresponding path program 1 times [2025-03-16 23:46:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-03-16 23:46:19,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:19,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:19,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:19,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:19,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-03-16 23:46:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216548786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:23,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:46:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979493005] [2025-03-16 23:46:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:46:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:23,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:46:23,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:46:23,278 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:24,239 INFO L93 Difference]: Finished difference Result 242 states and 362 transitions. [2025-03-16 23:46:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:46:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:24,242 INFO L225 Difference]: With dead ends: 242 [2025-03-16 23:46:24,242 INFO L226 Difference]: Without dead ends: 240 [2025-03-16 23:46:24,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:46:24,242 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 173 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:24,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1061 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:46:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-16 23:46:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 173. [2025-03-16 23:46:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 114 states have internal predecessors, (164), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-16 23:46:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-03-16 23:46:24,254 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 324 [2025-03-16 23:46:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:24,255 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-03-16 23:46:24,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-03-16 23:46:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:24,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:24,257 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:24,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:46:24,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:24,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -78867293, now seen corresponding path program 1 times [2025-03-16 23:46:24,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784044021] [2025-03-16 23:46:24,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:24,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:24,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:24,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:24,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784044021] [2025-03-16 23:46:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784044021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:24,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:46:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132676194] [2025-03-16 23:46:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:24,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:46:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:24,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:46:24,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:46:24,320 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:24,359 INFO L93 Difference]: Finished difference Result 499 states and 805 transitions. [2025-03-16 23:46:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:46:24,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:24,365 INFO L225 Difference]: With dead ends: 499 [2025-03-16 23:46:24,365 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 23:46:24,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:46:24,366 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 204 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:24,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 608 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:46:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 23:46:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2025-03-16 23:46:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 208 states have internal predecessors, (289), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-16 23:46:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 517 transitions. [2025-03-16 23:46:24,395 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 517 transitions. Word has length 324 [2025-03-16 23:46:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:24,396 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 517 transitions. [2025-03-16 23:46:24,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 517 transitions. [2025-03-16 23:46:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:24,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:24,397 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:24,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:46:24,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 808636388, now seen corresponding path program 1 times [2025-03-16 23:46:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-16 23:46:24,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:24,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:24,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:24,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:24,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-16 23:46:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001533786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:46:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145647299] [2025-03-16 23:46:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:46:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:24,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:46:24,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:46:24,503 INFO L87 Difference]: Start difference. First operand 325 states and 517 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:24,785 INFO L93 Difference]: Finished difference Result 969 states and 1530 transitions. [2025-03-16 23:46:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:46:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:24,788 INFO L225 Difference]: With dead ends: 969 [2025-03-16 23:46:24,789 INFO L226 Difference]: Without dead ends: 645 [2025-03-16 23:46:24,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:46:24,790 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 130 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:24,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 632 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:46:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-16 23:46:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 604. [2025-03-16 23:46:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 371 states have (on average 1.3881401617250675) internal successors, (515), 374 states have internal predecessors, (515), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-16 23:46:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 963 transitions. [2025-03-16 23:46:24,837 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 963 transitions. Word has length 324 [2025-03-16 23:46:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 963 transitions. [2025-03-16 23:46:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 963 transitions. [2025-03-16 23:46:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:24,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:24,839 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:46:24,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1743520573, now seen corresponding path program 1 times [2025-03-16 23:46:24,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:24,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165530620] [2025-03-16 23:46:24,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:24,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:24,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:24,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165530620] [2025-03-16 23:46:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165530620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:46:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965083785] [2025-03-16 23:46:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:26,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:46:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:26,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:46:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:46:26,776 INFO L87 Difference]: Start difference. First operand 604 states and 963 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:27,336 INFO L93 Difference]: Finished difference Result 738 states and 1118 transitions. [2025-03-16 23:46:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:46:27,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:27,343 INFO L225 Difference]: With dead ends: 738 [2025-03-16 23:46:27,343 INFO L226 Difference]: Without dead ends: 736 [2025-03-16 23:46:27,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:46:27,343 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 318 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:27,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 799 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:46:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-16 23:46:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 655. [2025-03-16 23:46:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 411 states have (on average 1.3698296836982968) internal successors, (563), 416 states have internal predecessors, (563), 232 states have call successors, (232), 11 states have call predecessors, (232), 11 states have return successors, (232), 227 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-16 23:46:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1027 transitions. [2025-03-16 23:46:27,397 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1027 transitions. Word has length 324 [2025-03-16 23:46:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:27,398 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1027 transitions. [2025-03-16 23:46:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1027 transitions. [2025-03-16 23:46:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:27,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:27,399 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:27,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:46:27,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1743490782, now seen corresponding path program 1 times [2025-03-16 23:46:27,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:27,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642811582] [2025-03-16 23:46:27,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:27,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:27,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:27,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:27,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:51,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:51,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642811582] [2025-03-16 23:46:51,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642811582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:51,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:51,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:46:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677084677] [2025-03-16 23:46:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:51,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:46:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:51,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:46:51,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:46:51,235 INFO L87 Difference]: Start difference. First operand 655 states and 1027 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:54,711 INFO L93 Difference]: Finished difference Result 727 states and 1106 transitions. [2025-03-16 23:46:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:46:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 324 [2025-03-16 23:46:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:54,716 INFO L225 Difference]: With dead ends: 727 [2025-03-16 23:46:54,716 INFO L226 Difference]: Without dead ends: 725 [2025-03-16 23:46:54,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-03-16 23:46:54,718 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 274 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:54,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1132 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 23:46:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-16 23:46:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 655. [2025-03-16 23:46:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 411 states have (on average 1.3698296836982968) internal successors, (563), 416 states have internal predecessors, (563), 232 states have call successors, (232), 11 states have call predecessors, (232), 11 states have return successors, (232), 227 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-16 23:46:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1027 transitions. [2025-03-16 23:46:54,773 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1027 transitions. Word has length 324 [2025-03-16 23:46:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1027 transitions. [2025-03-16 23:46:54,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-16 23:46:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1027 transitions. [2025-03-16 23:46:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-16 23:46:54,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:54,776 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:46:54,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1847166785, now seen corresponding path program 1 times [2025-03-16 23:46:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763347307] [2025-03-16 23:46:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:54,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-16 23:46:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-16 23:46:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2025-03-16 23:46:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763347307] [2025-03-16 23:46:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763347307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:46:55,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:46:55,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:46:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594813099] [2025-03-16 23:46:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:46:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:46:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:46:55,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:46:55,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:46:55,036 INFO L87 Difference]: Start difference. First operand 655 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-16 23:46:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:46:55,257 INFO L93 Difference]: Finished difference Result 1196 states and 1857 transitions. [2025-03-16 23:46:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:46:55,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 324 [2025-03-16 23:46:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:46:55,263 INFO L225 Difference]: With dead ends: 1196 [2025-03-16 23:46:55,263 INFO L226 Difference]: Without dead ends: 662 [2025-03-16 23:46:55,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:46:55,265 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 182 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:46:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 334 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:46:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-16 23:46:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 653. [2025-03-16 23:46:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 403 states have (on average 1.3449131513647643) internal successors, (542), 408 states have internal predecessors, (542), 236 states have call successors, (236), 13 states have call predecessors, (236), 13 states have return successors, (236), 231 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-16 23:46:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1014 transitions. [2025-03-16 23:46:55,321 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1014 transitions. Word has length 324 [2025-03-16 23:46:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:46:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1014 transitions. [2025-03-16 23:46:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-16 23:46:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1014 transitions. [2025-03-16 23:46:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-16 23:46:55,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:46:55,323 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:46:55,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:46:55,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:46:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:46:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -42256474, now seen corresponding path program 1 times [2025-03-16 23:46:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:46:55,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330134118] [2025-03-16 23:46:55,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:46:55,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 23:46:55,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 23:46:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 162 proven. 144 refuted. 0 times theorem prover too weak. 5206 trivial. 0 not checked. [2025-03-16 23:46:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:46:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330134118] [2025-03-16 23:46:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330134118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:46:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112031869] [2025-03-16 23:46:58,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:46:58,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:46:58,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:46:58,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:46:58,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:46:58,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-16 23:46:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-16 23:46:58,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:46:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:46:58,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-16 23:46:58,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:47:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 3725 proven. 309 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2025-03-16 23:47:00,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:47:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 411 proven. 339 refuted. 0 times theorem prover too weak. 4762 trivial. 0 not checked. [2025-03-16 23:47:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112031869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:47:05,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:47:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 23] total 56 [2025-03-16 23:47:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881487884] [2025-03-16 23:47:05,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:47:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-16 23:47:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:47:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-16 23:47:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2538, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 23:47:05,300 INFO L87 Difference]: Start difference. First operand 653 states and 1014 transitions. Second operand has 56 states, 53 states have (on average 3.339622641509434) internal successors, (177), 52 states have internal predecessors, (177), 19 states have call successors, (137), 7 states have call predecessors, (137), 16 states have return successors, (137), 19 states have call predecessors, (137), 19 states have call successors, (137)