./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.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_amount500_file-1.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 ea9feee752dca5e5614c423318b7c590a6ae07e20bba2cfd8d20956282c64c55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:29:08,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:29:08,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:29:08,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:29:08,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:29:08,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:29:08,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:29:08,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:29:08,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:29:08,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:29:08,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:29:08,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:29:08,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:29:08,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:29:08,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:29:08,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:29:08,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:29:08,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:29:08,673 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 -> ea9feee752dca5e5614c423318b7c590a6ae07e20bba2cfd8d20956282c64c55 [2025-03-04 00:29:08,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:29:08,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:29:08,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:29:08,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:29:08,891 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:29:08,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.i [2025-03-04 00:29:10,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd46909c/3e6820f072a54855b7281ce1d18b6180/FLAG0471d8727 [2025-03-04 00:29:10,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:29:10,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-1.i [2025-03-04 00:29:10,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd46909c/3e6820f072a54855b7281ce1d18b6180/FLAG0471d8727 [2025-03-04 00:29:10,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd46909c/3e6820f072a54855b7281ce1d18b6180 [2025-03-04 00:29:10,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:29:10,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:29:10,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:29:10,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:29:10,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:29:10,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:10,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1854a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10, skipping insertion in model container [2025-03-04 00:29:10,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:10,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:29:10,493 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_amount500_file-1.i[915,928] [2025-03-04 00:29:10,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:29:10,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:29:10,719 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_amount500_file-1.i[915,928] [2025-03-04 00:29:10,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:29:10,820 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:29:10,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10 WrapperNode [2025-03-04 00:29:10,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:29:10,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:29:10,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:29:10,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:29:10,825 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:29:10" (1/1) ... [2025-03-04 00:29:10,841 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:29:10" (1/1) ... [2025-03-04 00:29:10,933 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 750 [2025-03-04 00:29:10,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:29:10,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:29:10,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:29:10,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:29:10,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:10,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:10,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,076 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:29:11,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:29:11,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:29:11,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:29:11,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:29:11,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (1/1) ... [2025-03-04 00:29:11,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:29:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:29:11,175 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:29:11,180 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:29:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:29:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:29:11,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:29:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:29:11,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:29:11,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:29:11,300 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:29:11,301 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:29:12,176 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: havoc property_#t~ite49#1;havoc property_#t~bitwise47#1;havoc property_#t~bitwise48#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~bitwise58#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1; [2025-03-04 00:29:12,310 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 00:29:12,310 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:29:12,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:29:12,347 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:29:12,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:29:12 BoogieIcfgContainer [2025-03-04 00:29:12,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:29:12,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:29:12,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:29:12,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:29:12,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:29:10" (1/3) ... [2025-03-04 00:29:12,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a56446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:29:12, skipping insertion in model container [2025-03-04 00:29:12,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:29:10" (2/3) ... [2025-03-04 00:29:12,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a56446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:29:12, skipping insertion in model container [2025-03-04 00:29:12,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:29:12" (3/3) ... [2025-03-04 00:29:12,357 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-1.i [2025-03-04 00:29:12,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:29:12,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-1.i that has 2 procedures, 296 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:29:12,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:29:12,447 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;@336e329e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:29:12,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:29:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 232 states have (on average 1.5517241379310345) internal successors, (360), 233 states have internal predecessors, (360), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:29:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-04 00:29:12,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:12,473 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:12,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1975581494, now seen corresponding path program 1 times [2025-03-04 00:29:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:12,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610270637] [2025-03-04 00:29:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:12,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 00:29:12,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 00:29:12,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:29:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610270637] [2025-03-04 00:29:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610270637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:29:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716132635] [2025-03-04 00:29:13,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:13,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:29:13,066 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:29:13,068 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:29:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 00:29:13,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 00:29:13,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:13,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:13,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:29:13,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:29:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:29:13,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:29:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716132635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:13,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:29:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:29:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129090291] [2025-03-04 00:29:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:29:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:13,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:29:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:29:13,463 INFO L87 Difference]: Start difference. First operand has 296 states, 232 states have (on average 1.5517241379310345) internal successors, (360), 233 states have internal predecessors, (360), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:29:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:13,534 INFO L93 Difference]: Finished difference Result 583 states and 1014 transitions. [2025-03-04 00:29:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:29:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 436 [2025-03-04 00:29:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:13,542 INFO L225 Difference]: With dead ends: 583 [2025-03-04 00:29:13,542 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 00:29:13,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 437 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:29:13,548 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:13,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:29:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 00:29:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-04 00:29:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.52863436123348) internal successors, (347), 227 states have internal predecessors, (347), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:29:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 469 transitions. [2025-03-04 00:29:13,619 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 469 transitions. Word has length 436 [2025-03-04 00:29:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:13,619 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 469 transitions. [2025-03-04 00:29:13,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:29:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 469 transitions. [2025-03-04 00:29:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-04 00:29:13,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:13,631 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:13,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:29:13,835 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:29:13,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1660174387, now seen corresponding path program 1 times [2025-03-04 00:29:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128443799] [2025-03-04 00:29:13,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 00:29:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 00:29:14,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:15,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128443799] [2025-03-04 00:29:15,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128443799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:29:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568441725] [2025-03-04 00:29:15,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:29:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:15,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:29:15,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:29:15,746 INFO L87 Difference]: Start difference. First operand 290 states and 469 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:29:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:16,247 INFO L93 Difference]: Finished difference Result 750 states and 1211 transitions. [2025-03-04 00:29:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:29:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 436 [2025-03-04 00:29:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:16,256 INFO L225 Difference]: With dead ends: 750 [2025-03-04 00:29:16,256 INFO L226 Difference]: Without dead ends: 463 [2025-03-04 00:29:16,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:29:16,258 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 1014 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:16,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 784 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:29:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-04 00:29:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2025-03-04 00:29:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 378 states have (on average 1.5423280423280423) internal successors, (583), 379 states have internal predecessors, (583), 79 states have call successors, (79), 2 states have call predecessors, (79), 2 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:29:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 741 transitions. [2025-03-04 00:29:16,317 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 741 transitions. Word has length 436 [2025-03-04 00:29:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:16,319 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 741 transitions. [2025-03-04 00:29:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:29:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 741 transitions. [2025-03-04 00:29:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-04 00:29:16,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:16,323 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:16,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:29:16,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:16,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1940524276, now seen corresponding path program 1 times [2025-03-04 00:29:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504675477] [2025-03-04 00:29:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 00:29:16,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 00:29:16,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:16,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504675477] [2025-03-04 00:29:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504675477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:29:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819075064] [2025-03-04 00:29:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:17,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:29:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:17,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:29:17,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:17,535 INFO L87 Difference]: Start difference. First operand 460 states and 741 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:17,745 INFO L93 Difference]: Finished difference Result 1220 states and 1968 transitions. [2025-03-04 00:29:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:29:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 436 [2025-03-04 00:29:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:17,751 INFO L225 Difference]: With dead ends: 1220 [2025-03-04 00:29:17,752 INFO L226 Difference]: Without dead ends: 763 [2025-03-04 00:29:17,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:17,754 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 264 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:17,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1438 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:29:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-04 00:29:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 551. [2025-03-04 00:29:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 469 states have (on average 1.5692963752665245) internal successors, (736), 470 states have internal predecessors, (736), 79 states have call successors, (79), 2 states have call predecessors, (79), 2 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:29:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 894 transitions. [2025-03-04 00:29:17,805 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 894 transitions. Word has length 436 [2025-03-04 00:29:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:17,806 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 894 transitions. [2025-03-04 00:29:17,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 894 transitions. [2025-03-04 00:29:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-04 00:29:17,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:17,811 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:17,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:29:17,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1950640542, now seen corresponding path program 1 times [2025-03-04 00:29:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517681158] [2025-03-04 00:29:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:17,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-04 00:29:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-04 00:29:18,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:18,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517681158] [2025-03-04 00:29:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517681158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:29:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223521420] [2025-03-04 00:29:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:29:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:29:18,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:18,913 INFO L87 Difference]: Start difference. First operand 551 states and 894 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:18,996 INFO L93 Difference]: Finished difference Result 1101 states and 1788 transitions. [2025-03-04 00:29:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:29:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 437 [2025-03-04 00:29:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:19,002 INFO L225 Difference]: With dead ends: 1101 [2025-03-04 00:29:19,003 INFO L226 Difference]: Without dead ends: 553 [2025-03-04 00:29:19,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:19,007 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:19,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1346 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:29:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-04 00:29:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-04 00:29:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 471 states have (on average 1.5668789808917198) internal successors, (738), 472 states have internal predecessors, (738), 79 states have call successors, (79), 2 states have call predecessors, (79), 2 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:29:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 896 transitions. [2025-03-04 00:29:19,055 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 896 transitions. Word has length 437 [2025-03-04 00:29:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:19,056 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 896 transitions. [2025-03-04 00:29:19,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 896 transitions. [2025-03-04 00:29:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-04 00:29:19,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:19,059 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:29:19,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1059369162, now seen corresponding path program 1 times [2025-03-04 00:29:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544767791] [2025-03-04 00:29:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:19,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-04 00:29:19,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-04 00:29:19,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:19,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:20,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544767791] [2025-03-04 00:29:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544767791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:20,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:29:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734984409] [2025-03-04 00:29:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:20,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:29:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:20,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:29:20,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:29:20,067 INFO L87 Difference]: Start difference. First operand 553 states and 896 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:20,499 INFO L93 Difference]: Finished difference Result 1876 states and 3029 transitions. [2025-03-04 00:29:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:29:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 438 [2025-03-04 00:29:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:20,507 INFO L225 Difference]: With dead ends: 1876 [2025-03-04 00:29:20,507 INFO L226 Difference]: Without dead ends: 1326 [2025-03-04 00:29:20,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-04 00:29:20,509 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 645 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:20,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 2057 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:29:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-04 00:29:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1102. [2025-03-04 00:29:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 939 states have (on average 1.5686900958466454) internal successors, (1473), 941 states have internal predecessors, (1473), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-04 00:29:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1789 transitions. [2025-03-04 00:29:20,614 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1789 transitions. Word has length 438 [2025-03-04 00:29:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1789 transitions. [2025-03-04 00:29:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1789 transitions. [2025-03-04 00:29:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-04 00:29:20,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:20,621 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:29:20,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -149873077, now seen corresponding path program 1 times [2025-03-04 00:29:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158289326] [2025-03-04 00:29:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:20,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-04 00:29:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-04 00:29:20,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:20,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:21,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:21,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158289326] [2025-03-04 00:29:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158289326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:21,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:21,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:29:21,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771205407] [2025-03-04 00:29:21,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:21,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:29:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:21,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:29:21,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:21,779 INFO L87 Difference]: Start difference. First operand 1102 states and 1789 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:22,026 INFO L93 Difference]: Finished difference Result 3300 states and 5361 transitions. [2025-03-04 00:29:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:29:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 438 [2025-03-04 00:29:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:22,036 INFO L225 Difference]: With dead ends: 3300 [2025-03-04 00:29:22,037 INFO L226 Difference]: Without dead ends: 2201 [2025-03-04 00:29:22,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:29:22,040 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 459 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:22,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1498 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:29:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2025-03-04 00:29:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2199. [2025-03-04 00:29:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1874 states have (on average 1.5656350053361794) internal successors, (2934), 1878 states have internal predecessors, (2934), 316 states have call successors, (316), 8 states have call predecessors, (316), 8 states have return successors, (316), 312 states have call predecessors, (316), 316 states have call successors, (316) [2025-03-04 00:29:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3566 transitions. [2025-03-04 00:29:22,216 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3566 transitions. Word has length 438 [2025-03-04 00:29:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:22,217 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3566 transitions. [2025-03-04 00:29:22,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3566 transitions. [2025-03-04 00:29:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-04 00:29:22,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:22,221 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:29:22,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash -760275677, now seen corresponding path program 1 times [2025-03-04 00:29:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690685623] [2025-03-04 00:29:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:24,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:26,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690685623] [2025-03-04 00:29:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690685623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:29:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870094477] [2025-03-04 00:29:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:26,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:29:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:26,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:29:26,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:29:26,357 INFO L87 Difference]: Start difference. First operand 2199 states and 3566 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:29:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:28,669 INFO L93 Difference]: Finished difference Result 8564 states and 13791 transitions. [2025-03-04 00:29:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:29:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 439 [2025-03-04 00:29:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:28,699 INFO L225 Difference]: With dead ends: 8564 [2025-03-04 00:29:28,699 INFO L226 Difference]: Without dead ends: 6368 [2025-03-04 00:29:28,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:29:28,709 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2396 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:28,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 2648 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:29:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2025-03-04 00:29:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 4176. [2025-03-04 00:29:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3787 states have (on average 1.5854238183258516) internal successors, (6004), 3791 states have internal predecessors, (6004), 377 states have call successors, (377), 11 states have call predecessors, (377), 11 states have return successors, (377), 373 states have call predecessors, (377), 377 states have call successors, (377) [2025-03-04 00:29:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6758 transitions. [2025-03-04 00:29:28,949 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6758 transitions. Word has length 439 [2025-03-04 00:29:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 4176 states and 6758 transitions. [2025-03-04 00:29:28,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:29:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6758 transitions. [2025-03-04 00:29:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-04 00:29:28,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:28,956 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:29:28,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 82633671, now seen corresponding path program 1 times [2025-03-04 00:29:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520527172] [2025-03-04 00:29:28,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:28,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:29,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:29,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:29,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3 proven. 177 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:29:30,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520527172] [2025-03-04 00:29:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520527172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:29:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648760782] [2025-03-04 00:29:30,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:30,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:30,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:29:30,163 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:29:30,165 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:29:30,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:30,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:29:30,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:29:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3907 proven. 198 refuted. 0 times theorem prover too weak. 3215 trivial. 0 not checked. [2025-03-04 00:29:31,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:29:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 156 proven. 201 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2025-03-04 00:29:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648760782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:29:31,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:29:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-04 00:29:31,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871084930] [2025-03-04 00:29:31,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:29:31,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:29:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:31,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:29:31,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:29:31,841 INFO L87 Difference]: Start difference. First operand 4176 states and 6758 transitions. Second operand has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) [2025-03-04 00:29:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:32,754 INFO L93 Difference]: Finished difference Result 7644 states and 12216 transitions. [2025-03-04 00:29:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:29:32,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) Word has length 439 [2025-03-04 00:29:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:32,771 INFO L225 Difference]: With dead ends: 7644 [2025-03-04 00:29:32,771 INFO L226 Difference]: Without dead ends: 3660 [2025-03-04 00:29:32,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:29:32,779 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 876 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:32,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1204 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:29:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2025-03-04 00:29:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3572. [2025-03-04 00:29:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3164 states have (on average 1.5414032869785081) internal successors, (4877), 3168 states have internal predecessors, (4877), 377 states have call successors, (377), 30 states have call predecessors, (377), 30 states have return successors, (377), 373 states have call predecessors, (377), 377 states have call successors, (377) [2025-03-04 00:29:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 5631 transitions. [2025-03-04 00:29:32,986 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 5631 transitions. Word has length 439 [2025-03-04 00:29:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:32,986 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 5631 transitions. [2025-03-04 00:29:32,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 15 states have internal predecessors, (258), 6 states have call successors, (155), 3 states have call predecessors, (155), 7 states have return successors, (157), 6 states have call predecessors, (157), 6 states have call successors, (157) [2025-03-04 00:29:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 5631 transitions. [2025-03-04 00:29:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-04 00:29:32,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:32,991 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:32,999 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:29:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 00:29:33,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:33,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash -146127505, now seen corresponding path program 1 times [2025-03-04 00:29:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:33,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776538768] [2025-03-04 00:29:33,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:33,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:33,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:33,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:33,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:29:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776538768] [2025-03-04 00:29:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776538768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:29:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:29:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568450792] [2025-03-04 00:29:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:34,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:29:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:34,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:29:34,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:29:34,055 INFO L87 Difference]: Start difference. First operand 3572 states and 5631 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:34,422 INFO L93 Difference]: Finished difference Result 11848 states and 18652 transitions. [2025-03-04 00:29:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:29:34,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 439 [2025-03-04 00:29:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:34,454 INFO L225 Difference]: With dead ends: 11848 [2025-03-04 00:29:34,454 INFO L226 Difference]: Without dead ends: 9336 [2025-03-04 00:29:34,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:29:34,497 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1023 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:34,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2240 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:29:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2025-03-04 00:29:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 9236. [2025-03-04 00:29:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9236 states, 8716 states have (on average 1.565511702615879) internal successors, (13645), 8736 states have internal predecessors, (13645), 457 states have call successors, (457), 62 states have call predecessors, (457), 62 states have return successors, (457), 437 states have call predecessors, (457), 457 states have call successors, (457) [2025-03-04 00:29:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9236 states to 9236 states and 14559 transitions. [2025-03-04 00:29:34,971 INFO L78 Accepts]: Start accepts. Automaton has 9236 states and 14559 transitions. Word has length 439 [2025-03-04 00:29:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:34,972 INFO L471 AbstractCegarLoop]: Abstraction has 9236 states and 14559 transitions. [2025-03-04 00:29:34,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 9236 states and 14559 transitions. [2025-03-04 00:29:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-04 00:29:34,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:34,982 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:29:34,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:34,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -990599376, now seen corresponding path program 1 times [2025-03-04 00:29:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519658001] [2025-03-04 00:29:34,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:35,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:35,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:35,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:35,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 12 proven. 168 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:29:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519658001] [2025-03-04 00:29:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519658001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:29:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002292409] [2025-03-04 00:29:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:29:36,388 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:29:36,399 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:29:36,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:36,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:36,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:36,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:29:36,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:29:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:29:36,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:29:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002292409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:29:36,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:29:36,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 00:29:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562308533] [2025-03-04 00:29:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:29:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:29:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:36,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:29:36,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:29:36,705 INFO L87 Difference]: Start difference. First operand 9236 states and 14559 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:37,192 INFO L93 Difference]: Finished difference Result 18348 states and 28879 transitions. [2025-03-04 00:29:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:29:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) Word has length 439 [2025-03-04 00:29:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:37,217 INFO L225 Difference]: With dead ends: 18348 [2025-03-04 00:29:37,217 INFO L226 Difference]: Without dead ends: 9368 [2025-03-04 00:29:37,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:29:37,235 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 375 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:37,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1016 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:29:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9368 states. [2025-03-04 00:29:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9368 to 9256. [2025-03-04 00:29:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9256 states, 8731 states have (on average 1.5617913182911465) internal successors, (13636), 8751 states have internal predecessors, (13636), 457 states have call successors, (457), 67 states have call predecessors, (457), 67 states have return successors, (457), 437 states have call predecessors, (457), 457 states have call successors, (457) [2025-03-04 00:29:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9256 states to 9256 states and 14550 transitions. [2025-03-04 00:29:37,538 INFO L78 Accepts]: Start accepts. Automaton has 9256 states and 14550 transitions. Word has length 439 [2025-03-04 00:29:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:37,539 INFO L471 AbstractCegarLoop]: Abstraction has 9256 states and 14550 transitions. [2025-03-04 00:29:37,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (61), 1 states have call predecessors, (61), 2 states have return successors, (61), 2 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:29:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9256 states and 14550 transitions. [2025-03-04 00:29:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-04 00:29:37,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:37,548 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:37,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:29:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:37,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1474274703, now seen corresponding path program 1 times [2025-03-04 00:29:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24221122] [2025-03-04 00:29:37,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:37,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:38,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:38,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:38,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 12 proven. 168 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:29:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:29:38,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24221122] [2025-03-04 00:29:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24221122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:29:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59786840] [2025-03-04 00:29:38,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:38,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:38,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:29:38,787 INFO L229 MonitoredProcess]: Starting monitored process 5 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:29:38,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:29:38,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-04 00:29:39,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-04 00:29:39,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:29:39,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:29:39,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:29:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3120 proven. 126 refuted. 0 times theorem prover too weak. 4074 trivial. 0 not checked. [2025-03-04 00:29:39,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:29:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 54 proven. 126 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:29:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59786840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:29:39,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:29:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:29:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83114950] [2025-03-04 00:29:39,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:29:39,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:29:39,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:29:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:29:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:29:39,581 INFO L87 Difference]: Start difference. First operand 9256 states and 14550 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (159), 2 states have call predecessors, (159), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) [2025-03-04 00:29:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:29:40,169 INFO L93 Difference]: Finished difference Result 15450 states and 24179 transitions. [2025-03-04 00:29:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:29:40,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (159), 2 states have call predecessors, (159), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) Word has length 439 [2025-03-04 00:29:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:29:40,188 INFO L225 Difference]: With dead ends: 15450 [2025-03-04 00:29:40,188 INFO L226 Difference]: Without dead ends: 6614 [2025-03-04 00:29:40,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:29:40,200 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 840 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:29:40,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 940 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:29:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2025-03-04 00:29:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 6528. [2025-03-04 00:29:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6528 states, 6029 states have (on average 1.5451982086581522) internal successors, (9316), 6041 states have internal predecessors, (9316), 425 states have call successors, (425), 73 states have call predecessors, (425), 73 states have return successors, (425), 413 states have call predecessors, (425), 425 states have call successors, (425) [2025-03-04 00:29:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 10166 transitions. [2025-03-04 00:29:40,466 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 10166 transitions. Word has length 439 [2025-03-04 00:29:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:29:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 6528 states and 10166 transitions. [2025-03-04 00:29:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (159), 2 states have call predecessors, (159), 4 states have return successors, (161), 4 states have call predecessors, (161), 4 states have call successors, (161) [2025-03-04 00:29:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 10166 transitions. [2025-03-04 00:29:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-04 00:29:40,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:29:40,473 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:40,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:29:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:29:40,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:29:40,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:29:40,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1930151129, now seen corresponding path program 1 times [2025-03-04 00:29:40,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:29:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376179769] [2025-03-04 00:29:40,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:29:40,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:29:40,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-04 00:29:41,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-04 00:29:41,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:29:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat