./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-87.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 b5307a371ce4040b29e58213712f562a0e2a68de1ce11167436db0e47f91ed14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:27:39,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:27:39,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:27:39,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:27:39,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:27:39,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:27:39,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:27:39,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:27:39,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:27:39,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:27:39,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:27:39,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:27:39,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:27:39,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:27:39,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:27:39,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:27:39,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:27:39,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:27:39,563 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 -> b5307a371ce4040b29e58213712f562a0e2a68de1ce11167436db0e47f91ed14 [2025-03-08 15:27:39,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:27:39,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:27:39,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:27:39,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:27:39,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:27:39,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-87.i [2025-03-08 15:27:40,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81da1db07/df396c3e4f614f2cab49aa2cd482e9cd/FLAGaca2da230 [2025-03-08 15:27:41,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:27:41,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-87.i [2025-03-08 15:27:41,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81da1db07/df396c3e4f614f2cab49aa2cd482e9cd/FLAGaca2da230 [2025-03-08 15:27:41,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81da1db07/df396c3e4f614f2cab49aa2cd482e9cd [2025-03-08 15:27:41,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:27:41,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:27:41,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:27:41,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:27:41,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:27:41,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:41,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c4ba4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41, skipping insertion in model container [2025-03-08 15:27:41,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:41,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:27:41,688 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_operatoramount_amount250_file-87.i[916,929] [2025-03-08 15:27:41,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:27:41,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:27:41,845 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_operatoramount_amount250_file-87.i[916,929] [2025-03-08 15:27:41,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:27:41,927 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:27:41,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41 WrapperNode [2025-03-08 15:27:41,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:27:41,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:27:41,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:27:41,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:27:41,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:41,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,012 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-03-08 15:27:42,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:27:42,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:27:42,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:27:42,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:27:42,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:27:42,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:27:42,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:27:42,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:27:42,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:27:42,120 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (1/1) ... [2025-03-08 15:27:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:27:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:42,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:27:42,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:27:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:27:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:27:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:27:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:27:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:27:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:27:42,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:27:42,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:27:42,995 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~ite48#1;havoc property_#t~bitwise47#1;havoc property_#t~short49#1; [2025-03-08 15:27:43,070 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-08 15:27:43,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:27:43,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:27:43,098 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:27:43,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:27:43 BoogieIcfgContainer [2025-03-08 15:27:43,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:27:43,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:27:43,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:27:43,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:27:43,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:27:41" (1/3) ... [2025-03-08 15:27:43,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163987c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:27:43, skipping insertion in model container [2025-03-08 15:27:43,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:27:41" (2/3) ... [2025-03-08 15:27:43,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163987c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:27:43, skipping insertion in model container [2025-03-08 15:27:43,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:27:43" (3/3) ... [2025-03-08 15:27:43,106 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-87.i [2025-03-08 15:27:43,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:27:43,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-87.i that has 2 procedures, 200 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:27:43,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:27:43,179 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;@57956057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:27:43,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:27:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 136 states have internal predecessors, (198), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:27:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 15:27:43,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:43,202 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:27:43,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:43,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2010792539, now seen corresponding path program 1 times [2025-03-08 15:27:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229972773] [2025-03-08 15:27:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:43,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 15:27:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 15:27:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-08 15:27:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229972773] [2025-03-08 15:27:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229972773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:27:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555543106] [2025-03-08 15:27:43,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:43,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:27:43,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:27:43,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:27:43,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:27:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 15:27:43,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 15:27:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:43,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:27:43,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:27:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-08 15:27:44,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:27:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555543106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:27:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:27:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918031248] [2025-03-08 15:27:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:27:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:44,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:27:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:27:44,034 INFO L87 Difference]: Start difference. First operand has 200 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 136 states have internal predecessors, (198), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:27:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:44,092 INFO L93 Difference]: Finished difference Result 394 states and 701 transitions. [2025-03-08 15:27:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:27:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 390 [2025-03-08 15:27:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:44,103 INFO L225 Difference]: With dead ends: 394 [2025-03-08 15:27:44,103 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 15:27:44,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:27:44,112 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:44,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:27:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 15:27:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 15:27:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 133 states have internal predecessors, (193), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:27:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2025-03-08 15:27:44,172 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 390 [2025-03-08 15:27:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:44,173 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2025-03-08 15:27:44,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:27:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2025-03-08 15:27:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 15:27:44,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:44,183 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:27:44,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:27:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:27:44,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -338704253, now seen corresponding path program 1 times [2025-03-08 15:27:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97555582] [2025-03-08 15:27:44,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 15:27:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 15:27:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:27:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97555582] [2025-03-08 15:27:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97555582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617917299] [2025-03-08 15:27:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:44,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:44,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:44,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:44,759 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:27:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:44,901 INFO L93 Difference]: Finished difference Result 576 states and 930 transitions. [2025-03-08 15:27:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:44,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 390 [2025-03-08 15:27:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:44,935 INFO L225 Difference]: With dead ends: 576 [2025-03-08 15:27:44,935 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 15:27:44,936 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-08 15:27:44,936 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 303 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:44,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 864 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 15:27:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 202. [2025-03-08 15:27:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 138 states have (on average 1.4492753623188406) internal successors, (200), 138 states have internal predecessors, (200), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:27:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 324 transitions. [2025-03-08 15:27:44,964 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 324 transitions. Word has length 390 [2025-03-08 15:27:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 324 transitions. [2025-03-08 15:27:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:27:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 324 transitions. [2025-03-08 15:27:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-08 15:27:44,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:44,971 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:27:44,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:27:44,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:44,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash -8938492, now seen corresponding path program 1 times [2025-03-08 15:27:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141700924] [2025-03-08 15:27:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:45,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-08 15:27:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-08 15:27:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:27:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:27:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:27:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141700924] [2025-03-08 15:27:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141700924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:27:45,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:27:45,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:27:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773544341] [2025-03-08 15:27:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:27:45,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:27:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:27:45,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:27:45,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:45,570 INFO L87 Difference]: Start difference. First operand 202 states and 324 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:27:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:27:45,706 INFO L93 Difference]: Finished difference Result 600 states and 966 transitions. [2025-03-08 15:27:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:27:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 390 [2025-03-08 15:27:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:27:45,711 INFO L225 Difference]: With dead ends: 600 [2025-03-08 15:27:45,711 INFO L226 Difference]: Without dead ends: 401 [2025-03-08 15:27:45,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:27:45,712 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 180 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:27:45,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 618 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:27:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-08 15:27:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 397. [2025-03-08 15:27:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 270 states have (on average 1.4370370370370371) internal successors, (388), 270 states have internal predecessors, (388), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:27:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 636 transitions. [2025-03-08 15:27:45,771 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 636 transitions. Word has length 390 [2025-03-08 15:27:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:27:45,771 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 636 transitions. [2025-03-08 15:27:45,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:27:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 636 transitions. [2025-03-08 15:27:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 15:27:45,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:27:45,797 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:27:45,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:27:45,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:27:45,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:27:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash 911348920, now seen corresponding path program 1 times [2025-03-08 15:27:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:27:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524472195] [2025-03-08 15:27:45,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:27:45,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:27:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 15:27:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 15:27:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:27:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:28:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524472195] [2025-03-08 15:28:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524472195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:06,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:28:06,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835266514] [2025-03-08 15:28:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:28:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:06,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:28:06,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:28:06,233 INFO L87 Difference]: Start difference. First operand 397 states and 636 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:17,951 INFO L93 Difference]: Finished difference Result 1178 states and 1877 transitions. [2025-03-08 15:28:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:28:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 391 [2025-03-08 15:28:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:17,957 INFO L225 Difference]: With dead ends: 1178 [2025-03-08 15:28:17,957 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 15:28:17,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:28:17,959 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 1476 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:17,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1581 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-08 15:28:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 15:28:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 472. [2025-03-08 15:28:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 345 states have (on average 1.4869565217391305) internal successors, (513), 345 states have internal predecessors, (513), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:28:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 761 transitions. [2025-03-08 15:28:18,004 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 761 transitions. Word has length 391 [2025-03-08 15:28:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:18,006 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 761 transitions. [2025-03-08 15:28:18,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 761 transitions. [2025-03-08 15:28:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 15:28:18,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:18,010 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:28:18,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:28:18,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:18,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash 922665047, now seen corresponding path program 1 times [2025-03-08 15:28:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579705285] [2025-03-08 15:28:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:18,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 15:28:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 15:28:18,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:18,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:28:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:18,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579705285] [2025-03-08 15:28:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579705285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:18,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913987103] [2025-03-08 15:28:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:18,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:18,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:18,499 INFO L87 Difference]: Start difference. First operand 472 states and 761 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:18,812 INFO L93 Difference]: Finished difference Result 941 states and 1519 transitions. [2025-03-08 15:28:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:28:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 391 [2025-03-08 15:28:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:18,816 INFO L225 Difference]: With dead ends: 941 [2025-03-08 15:28:18,816 INFO L226 Difference]: Without dead ends: 472 [2025-03-08 15:28:18,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:18,819 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 330 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 471 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:28:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-08 15:28:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-08 15:28:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 345 states have (on average 1.4782608695652173) internal successors, (510), 345 states have internal predecessors, (510), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:28:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 758 transitions. [2025-03-08 15:28:18,850 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 758 transitions. Word has length 391 [2025-03-08 15:28:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:18,852 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 758 transitions. [2025-03-08 15:28:18,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 758 transitions. [2025-03-08 15:28:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 15:28:18,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:18,857 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:28:18,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:28:18,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:18,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash -473551003, now seen corresponding path program 1 times [2025-03-08 15:28:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855776841] [2025-03-08 15:28:18,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:18,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 15:28:19,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 15:28:19,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:19,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:28:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855776841] [2025-03-08 15:28:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855776841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:28,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:28,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:28:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716488438] [2025-03-08 15:28:28,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:28,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:28:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:28,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:28:28,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:28,404 INFO L87 Difference]: Start difference. First operand 472 states and 758 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:33,668 INFO L93 Difference]: Finished difference Result 1466 states and 2334 transitions. [2025-03-08 15:28:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:28:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 391 [2025-03-08 15:28:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:33,674 INFO L225 Difference]: With dead ends: 1466 [2025-03-08 15:28:33,674 INFO L226 Difference]: Without dead ends: 997 [2025-03-08 15:28:33,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:28:33,680 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 567 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:33,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1398 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 15:28:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-03-08 15:28:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 521. [2025-03-08 15:28:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 394 states have (on average 1.4873096446700507) internal successors, (586), 394 states have internal predecessors, (586), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:28:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 834 transitions. [2025-03-08 15:28:33,706 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 834 transitions. Word has length 391 [2025-03-08 15:28:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:33,707 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 834 transitions. [2025-03-08 15:28:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 834 transitions. [2025-03-08 15:28:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 15:28:33,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:33,709 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:28:33,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:28:33,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash -113345001, now seen corresponding path program 1 times [2025-03-08 15:28:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261266961] [2025-03-08 15:28:33,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:33,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 15:28:33,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 15:28:33,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:33,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:28:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261266961] [2025-03-08 15:28:43,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261266961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:43,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:43,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:28:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897961872] [2025-03-08 15:28:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:28:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:43,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:28:43,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:43,855 INFO L87 Difference]: Start difference. First operand 521 states and 834 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:46,911 INFO L93 Difference]: Finished difference Result 1376 states and 2188 transitions. [2025-03-08 15:28:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:28:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 391 [2025-03-08 15:28:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:46,917 INFO L225 Difference]: With dead ends: 1376 [2025-03-08 15:28:46,917 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 15:28:46,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:28:46,919 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 570 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:46,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1110 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 15:28:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 15:28:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 507. [2025-03-08 15:28:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 380 states have (on average 1.4789473684210526) internal successors, (562), 380 states have internal predecessors, (562), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:28:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 810 transitions. [2025-03-08 15:28:46,944 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 810 transitions. Word has length 391 [2025-03-08 15:28:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 810 transitions. [2025-03-08 15:28:46,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:28:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 810 transitions. [2025-03-08 15:28:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 15:28:46,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:46,947 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:28:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:28:46,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1755134495, now seen corresponding path program 1 times [2025-03-08 15:28:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305521529] [2025-03-08 15:28:46,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:46,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 15:28:47,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 15:28:47,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:47,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:29:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305521529] [2025-03-08 15:29:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305521529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:05,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 15:29:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782557885] [2025-03-08 15:29:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:05,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:29:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:05,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:29:05,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:29:05,812 INFO L87 Difference]: Start difference. First operand 507 states and 810 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62)