./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-16.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 8e52341f27f00c0c2ceedafaab379711ebb86ba8e7b8a717254138078fb8d030 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:50,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:50,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:50,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:50,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:50,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:50,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:50,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:50,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:50,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:50,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:50,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:50,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:50,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:50,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:50,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:50,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:50,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:50,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:50,951 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 -> 8e52341f27f00c0c2ceedafaab379711ebb86ba8e7b8a717254138078fb8d030 [2025-03-04 00:07:51,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:51,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:51,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:51,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:51,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:51,176 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-16.i [2025-03-04 00:07:52,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6477e5fe/3c6be77786174a0a85c3cca3941be254/FLAG943b1c1ae [2025-03-04 00:07:52,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:52,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-16.i [2025-03-04 00:07:52,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6477e5fe/3c6be77786174a0a85c3cca3941be254/FLAG943b1c1ae [2025-03-04 00:07:52,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6477e5fe/3c6be77786174a0a85c3cca3941be254 [2025-03-04 00:07:52,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:52,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:52,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:52,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:52,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:52,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:52" (1/1) ... [2025-03-04 00:07:52,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538f9e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:52, skipping insertion in model container [2025-03-04 00:07:52,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:52" (1/1) ... [2025-03-04 00:07:52,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:52,975 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-16.i[916,929] [2025-03-04 00:07:53,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:53,067 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:53,075 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-16.i[916,929] [2025-03-04 00:07:53,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:53,127 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:53,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53 WrapperNode [2025-03-04 00:07:53,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:53,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:53,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:53,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:53,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,201 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-03-04 00:07:53,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:53,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:53,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:53,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:53,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,235 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-04 00:07:53,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:53,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:53,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:53,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:53,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (1/1) ... [2025-03-04 00:07:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:53,311 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-04 00:07:53,314 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-04 00:07:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:53,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:53,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:53,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:54,304 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L355: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~bitwise39#1;havoc property_#t~short40#1; [2025-03-04 00:07:54,412 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:54,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:54,450 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:54,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:54,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:54 BoogieIcfgContainer [2025-03-04 00:07:54,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:54,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:54,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:54,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:54,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:52" (1/3) ... [2025-03-04 00:07:54,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448df326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:54, skipping insertion in model container [2025-03-04 00:07:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:53" (2/3) ... [2025-03-04 00:07:54,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448df326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:54, skipping insertion in model container [2025-03-04 00:07:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:54" (3/3) ... [2025-03-04 00:07:54,469 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-16.i [2025-03-04 00:07:54,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:54,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-16.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:54,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:54,616 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;@4ea9f2a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:54,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:07:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 00:07:54,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:54,657 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:54,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1701040520, now seen corresponding path program 1 times [2025-03-04 00:07:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406843339] [2025-03-04 00:07:54,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:54,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:54,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:54,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-04 00:07:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406843339] [2025-03-04 00:07:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406843339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893485173] [2025-03-04 00:07:55,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:55,327 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-04 00:07:55,328 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-04 00:07:55,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:55,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:55,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:55,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:55,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:55,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-04 00:07:55,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893485173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:55,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:55,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:07:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797446817] [2025-03-04 00:07:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:55,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:55,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:55,912 INFO L87 Difference]: Start difference. First operand has 168 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:07:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:56,008 INFO L93 Difference]: Finished difference Result 330 states and 586 transitions. [2025-03-04 00:07:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 321 [2025-03-04 00:07:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:56,018 INFO L225 Difference]: With dead ends: 330 [2025-03-04 00:07:56,023 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 00:07:56,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 322 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-04 00:07:56,035 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:56,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 00:07:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-04 00:07:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 114 states have internal predecessors, (167), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:07:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 265 transitions. [2025-03-04 00:07:56,119 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 265 transitions. Word has length 321 [2025-03-04 00:07:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:56,124 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 265 transitions. [2025-03-04 00:07:56,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:07:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 265 transitions. [2025-03-04 00:07:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 00:07:56,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:56,137 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:56,153 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-04 00:07:56,338 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-04 00:07:56,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -238458265, now seen corresponding path program 1 times [2025-03-04 00:07:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380459580] [2025-03-04 00:07:56,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:56,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:56,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:56,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:56,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:07:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380459580] [2025-03-04 00:07:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380459580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210715874] [2025-03-04 00:07:56,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:56,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:56,998 INFO L87 Difference]: Start difference. First operand 165 states and 265 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:57,218 INFO L93 Difference]: Finished difference Result 476 states and 766 transitions. [2025-03-04 00:07:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 321 [2025-03-04 00:07:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:57,227 INFO L225 Difference]: With dead ends: 476 [2025-03-04 00:07:57,229 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 00:07:57,230 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-04 00:07:57,235 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 222 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:57,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 690 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 00:07:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 189. [2025-03-04 00:07:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5) internal successors, (207), 138 states have internal predecessors, (207), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:07:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 305 transitions. [2025-03-04 00:07:57,289 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 305 transitions. Word has length 321 [2025-03-04 00:07:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:57,294 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 305 transitions. [2025-03-04 00:07:57,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 305 transitions. [2025-03-04 00:07:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 00:07:57,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:57,303 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:57,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash 112341672, now seen corresponding path program 1 times [2025-03-04 00:07:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460685335] [2025-03-04 00:07:57,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:57,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:57,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:57,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:07:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460685335] [2025-03-04 00:07:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460685335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366036548] [2025-03-04 00:07:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:58,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:58,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:58,643 INFO L87 Difference]: Start difference. First operand 189 states and 305 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:59,058 INFO L93 Difference]: Finished difference Result 661 states and 1074 transitions. [2025-03-04 00:07:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 321 [2025-03-04 00:07:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:59,069 INFO L225 Difference]: With dead ends: 661 [2025-03-04 00:07:59,070 INFO L226 Difference]: Without dead ends: 475 [2025-03-04 00:07:59,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:59,072 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 289 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:59,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 860 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:07:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-04 00:07:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 381. [2025-03-04 00:07:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:07:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 618 transitions. [2025-03-04 00:07:59,171 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 618 transitions. Word has length 321 [2025-03-04 00:07:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:59,172 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 618 transitions. [2025-03-04 00:07:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 618 transitions. [2025-03-04 00:07:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-04 00:07:59,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:59,180 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:59,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:07:59,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1163686661, now seen corresponding path program 1 times [2025-03-04 00:07:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257543281] [2025-03-04 00:07:59,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:59,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-04 00:07:59,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-04 00:07:59,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:59,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257543281] [2025-03-04 00:08:00,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257543281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:00,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673785535] [2025-03-04 00:08:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:00,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:00,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:00,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:00,091 INFO L87 Difference]: Start difference. First operand 381 states and 618 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:00,232 INFO L93 Difference]: Finished difference Result 1137 states and 1848 transitions. [2025-03-04 00:08:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:00,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 322 [2025-03-04 00:08:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:00,244 INFO L225 Difference]: With dead ends: 1137 [2025-03-04 00:08:00,248 INFO L226 Difference]: Without dead ends: 759 [2025-03-04 00:08:00,250 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-04 00:08:00,251 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 158 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:00,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 505 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:08:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-04 00:08:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2025-03-04 00:08:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 556 states have (on average 1.5035971223021583) internal successors, (836), 556 states have internal predecessors, (836), 196 states have call successors, (196), 4 states have call predecessors, (196), 4 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-04 00:08:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1228 transitions. [2025-03-04 00:08:00,487 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1228 transitions. Word has length 322 [2025-03-04 00:08:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1228 transitions. [2025-03-04 00:08:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1228 transitions. [2025-03-04 00:08:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-04 00:08:00,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:00,498 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:08:00,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1375037574, now seen corresponding path program 1 times [2025-03-04 00:08:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54324074] [2025-03-04 00:08:00,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:00,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-04 00:08:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-04 00:08:00,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54324074] [2025-03-04 00:08:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54324074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:08:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92049492] [2025-03-04 00:08:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:02,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:08:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:02,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:08:02,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:08:02,508 INFO L87 Difference]: Start difference. First operand 757 states and 1228 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:03,696 INFO L93 Difference]: Finished difference Result 1938 states and 3145 transitions. [2025-03-04 00:08:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:08:03,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 322 [2025-03-04 00:08:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:03,715 INFO L225 Difference]: With dead ends: 1938 [2025-03-04 00:08:03,719 INFO L226 Difference]: Without dead ends: 1184 [2025-03-04 00:08:03,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:08:03,725 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 321 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:03,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 835 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:08:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-03-04 00:08:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1154. [2025-03-04 00:08:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 903 states have (on average 1.539313399778516) internal successors, (1390), 903 states have internal predecessors, (1390), 245 states have call successors, (245), 5 states have call predecessors, (245), 5 states have return successors, (245), 245 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-04 00:08:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1880 transitions. [2025-03-04 00:08:03,965 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1880 transitions. Word has length 322 [2025-03-04 00:08:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1880 transitions. [2025-03-04 00:08:03,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1880 transitions. [2025-03-04 00:08:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-04 00:08:03,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:03,982 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:03,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:08:03,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -969629467, now seen corresponding path program 1 times [2025-03-04 00:08:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095448649] [2025-03-04 00:08:03,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:04,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-04 00:08:04,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-04 00:08:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:08:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095448649] [2025-03-04 00:08:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095448649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:05,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:08:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944770458] [2025-03-04 00:08:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:05,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:08:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:05,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:08:05,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:08:05,100 INFO L87 Difference]: Start difference. First operand 1154 states and 1880 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:05,767 INFO L93 Difference]: Finished difference Result 3638 states and 5933 transitions. [2025-03-04 00:08:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:08:05,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 322 [2025-03-04 00:08:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:05,795 INFO L225 Difference]: With dead ends: 3638 [2025-03-04 00:08:05,798 INFO L226 Difference]: Without dead ends: 2580 [2025-03-04 00:08:05,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:08:05,811 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 290 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:05,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 849 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:08:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-03-04 00:08:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2204. [2025-03-04 00:08:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1753 states have (on average 1.5390758699372504) internal successors, (2698), 1753 states have internal predecessors, (2698), 441 states have call successors, (441), 9 states have call predecessors, (441), 9 states have return successors, (441), 441 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-04 00:08:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 3580 transitions. [2025-03-04 00:08:06,227 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 3580 transitions. Word has length 322 [2025-03-04 00:08:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:06,228 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 3580 transitions. [2025-03-04 00:08:06,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:08:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 3580 transitions. [2025-03-04 00:08:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 00:08:06,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:06,236 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:08:06,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1402844647, now seen corresponding path program 1 times [2025-03-04 00:08:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38125176] [2025-03-04 00:08:06,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:06,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 00:08:07,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 00:08:07,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:07,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:08:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38125176] [2025-03-04 00:08:08,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38125176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035946819] [2025-03-04 00:08:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:08,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:08,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:08,650 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-04 00:08:08,651 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-04 00:08:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 00:08:08,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 00:08:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:08,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 00:08:08,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 3401 proven. 486 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-03-04 00:08:13,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 324 proven. 495 refuted. 0 times theorem prover too weak. 3885 trivial. 0 not checked. [2025-03-04 00:08:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035946819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:21,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:08:21,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 25, 26] total 56 [2025-03-04 00:08:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217874202] [2025-03-04 00:08:21,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:21,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 00:08:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:21,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 00:08:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=2345, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 00:08:21,902 INFO L87 Difference]: Start difference. First operand 2204 states and 3580 transitions. Second operand has 56 states, 55 states have (on average 4.163636363636364) internal successors, (229), 54 states have internal predecessors, (229), 18 states have call successors, (147), 9 states have call predecessors, (147), 21 states have return successors, (147), 18 states have call predecessors, (147), 18 states have call successors, (147) [2025-03-04 00:08:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:53,055 INFO L93 Difference]: Finished difference Result 39097 states and 60661 transitions. [2025-03-04 00:08:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 353 states. [2025-03-04 00:08:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 4.163636363636364) internal successors, (229), 54 states have internal predecessors, (229), 18 states have call successors, (147), 9 states have call predecessors, (147), 21 states have return successors, (147), 18 states have call predecessors, (147), 18 states have call successors, (147) Word has length 323 [2025-03-04 00:08:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:53,333 INFO L225 Difference]: With dead ends: 39097 [2025-03-04 00:08:53,336 INFO L226 Difference]: Without dead ends: 37071 [2025-03-04 00:08:53,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71161 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=23449, Invalid=137753, Unknown=0, NotChecked=0, Total=161202 [2025-03-04 00:08:53,449 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 12033 mSDsluCounter, 6580 mSDsCounter, 0 mSdLazyCounter, 10235 mSolverCounterSat, 3313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12034 SdHoareTripleChecker+Valid, 7138 SdHoareTripleChecker+Invalid, 13548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3313 IncrementalHoareTripleChecker+Valid, 10235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:53,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12034 Valid, 7138 Invalid, 13548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3313 Valid, 10235 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-03-04 00:08:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2025-03-04 00:08:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 22901. [2025-03-04 00:08:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22901 states, 19913 states have (on average 1.5479837292221161) internal successors, (30825), 19973 states have internal predecessors, (30825), 2601 states have call successors, (2601), 386 states have call predecessors, (2601), 386 states have return successors, (2601), 2541 states have call predecessors, (2601), 2601 states have call successors, (2601) [2025-03-04 00:08:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22901 states to 22901 states and 36027 transitions. [2025-03-04 00:08:56,514 INFO L78 Accepts]: Start accepts. Automaton has 22901 states and 36027 transitions. Word has length 323 [2025-03-04 00:08:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:56,519 INFO L471 AbstractCegarLoop]: Abstraction has 22901 states and 36027 transitions. [2025-03-04 00:08:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.163636363636364) internal successors, (229), 54 states have internal predecessors, (229), 18 states have call successors, (147), 9 states have call predecessors, (147), 21 states have return successors, (147), 18 states have call predecessors, (147), 18 states have call successors, (147) [2025-03-04 00:08:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22901 states and 36027 transitions. [2025-03-04 00:08:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-04 00:08:56,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:56,550 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:56,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:08:56,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 00:08:56,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:56,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 123414181, now seen corresponding path program 1 times [2025-03-04 00:08:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:56,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319537372] [2025-03-04 00:08:56,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 00:08:57,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 00:08:57,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 129 proven. 285 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2025-03-04 00:09:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319537372] [2025-03-04 00:09:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319537372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848734834] [2025-03-04 00:09:03,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:03,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:09:03,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:09:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-04 00:09:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-04 00:09:03,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:03,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:03,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 00:09:03,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 3222 proven. 417 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2025-03-04 00:09:07,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 393 proven. 426 refuted. 0 times theorem prover too weak. 3885 trivial. 0 not checked. [2025-03-04 00:09:10,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848734834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:10,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:10,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 26] total 63 [2025-03-04 00:09:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478178815] [2025-03-04 00:09:10,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 00:09:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:10,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 00:09:10,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=3143, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 00:09:10,385 INFO L87 Difference]: Start difference. First operand 22901 states and 36027 transitions. Second operand has 63 states, 59 states have (on average 3.9152542372881354) internal successors, (231), 56 states have internal predecessors, (231), 22 states have call successors, (147), 9 states have call predecessors, (147), 19 states have return successors, (147), 21 states have call predecessors, (147), 22 states have call successors, (147)