./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.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_loopvsstraightlinecode_100-while_file-92.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 c469b75cc3acec0afb4777ccbc446a0a894bfe2960322167d3fdb024eb8caf56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:04:37,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:04:37,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:04:37,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:04:37,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:04:37,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:04:37,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:04:37,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:04:37,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:04:37,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:04:37,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:04:37,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:04:37,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:04:37,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:04:37,385 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:04:37,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:04:37,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:04:37,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:04:37,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:04:37,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:04:37,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:37,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:04:37,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:04:37,389 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 -> c469b75cc3acec0afb4777ccbc446a0a894bfe2960322167d3fdb024eb8caf56 [2025-03-03 23:04:37,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:04:37,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:04:37,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:04:37,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:04:37,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:04:37,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.i [2025-03-03 23:04:38,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afbb2037/ceef42472b6f482e83005b72300dc801/FLAG35cb017ca [2025-03-03 23:04:39,053 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:04:39,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-92.i [2025-03-03 23:04:39,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afbb2037/ceef42472b6f482e83005b72300dc801/FLAG35cb017ca [2025-03-03 23:04:39,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afbb2037/ceef42472b6f482e83005b72300dc801 [2025-03-03 23:04:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:04:39,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:04:39,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:39,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:04:39,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:04:39,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4763f90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39, skipping insertion in model container [2025-03-03 23:04:39,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:04:39,534 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_loopvsstraightlinecode_100-while_file-92.i[916,929] [2025-03-03 23:04:39,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:39,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:04:39,645 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_loopvsstraightlinecode_100-while_file-92.i[916,929] [2025-03-03 23:04:39,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:39,707 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:04:39,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39 WrapperNode [2025-03-03 23:04:39,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:39,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:39,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:04:39,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:04:39,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,776 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 307 [2025-03-03 23:04:39,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:39,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:04:39,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:04:39,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:04:39,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:04:39,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:04:39,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:04:39,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:04:39,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:04:39,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (1/1) ... [2025-03-03 23:04:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:39,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:39,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:04:39,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:04:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:04:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:04:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:04:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:04:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:04:39,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:04:39,959 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:04:39,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:04:40,413 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~ite27#1;havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short33#1; [2025-03-03 23:04:40,443 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 23:04:40,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:04:40,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:04:40,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:04:40,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:40 BoogieIcfgContainer [2025-03-03 23:04:40,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:04:40,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:04:40,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:04:40,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:04:40,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:39" (1/3) ... [2025-03-03 23:04:40,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b3e7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:40, skipping insertion in model container [2025-03-03 23:04:40,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:39" (2/3) ... [2025-03-03 23:04:40,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b3e7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:40, skipping insertion in model container [2025-03-03 23:04:40,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:40" (3/3) ... [2025-03-03 23:04:40,479 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-92.i [2025-03-03 23:04:40,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:04:40,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-92.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:04:40,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:04:40,556 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;@e0c5b59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:04:40,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:04:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 101 states have (on average 1.495049504950495) internal successors, (151), 102 states have internal predecessors, (151), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:04:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 23:04:40,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:40,571 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:04:40,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1282591107, now seen corresponding path program 1 times [2025-03-03 23:04:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46757348] [2025-03-03 23:04:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:40,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 23:04:40,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 23:04:40,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 23:04:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46757348] [2025-03-03 23:04:40,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46757348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:40,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009962853] [2025-03-03 23:04:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:40,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:40,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:40,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:04:40,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 23:04:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 23:04:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:41,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:04:41,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 23:04:41,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:04:41,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009962853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:04:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:04:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779313249] [2025-03-03 23:04:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:04:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:41,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:04:41,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:04:41,057 INFO L87 Difference]: Start difference. First operand has 126 states, 101 states have (on average 1.495049504950495) internal successors, (151), 102 states have internal predecessors, (151), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:04:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:41,090 INFO L93 Difference]: Finished difference Result 246 states and 407 transitions. [2025-03-03 23:04:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:04:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2025-03-03 23:04:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:41,095 INFO L225 Difference]: With dead ends: 246 [2025-03-03 23:04:41,095 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 23:04:41,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:04:41,099 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:41,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:04:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 23:04:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-03 23:04:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 23:04:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2025-03-03 23:04:41,132 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159 [2025-03-03 23:04:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:41,133 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2025-03-03 23:04:41,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 23:04:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2025-03-03 23:04:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 23:04:41,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:41,136 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:04:41,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:04:41,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:04:41,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:41,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1010784005, now seen corresponding path program 1 times [2025-03-03 23:04:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:41,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643758430] [2025-03-03 23:04:41,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 23:04:41,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 23:04:41,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:41,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:04:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643758430] [2025-03-03 23:04:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643758430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:04:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815633515] [2025-03-03 23:04:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:04:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:41,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:04:41,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:04:41,742 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:04:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:41,847 INFO L93 Difference]: Finished difference Result 363 states and 564 transitions. [2025-03-03 23:04:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:04:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2025-03-03 23:04:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:41,850 INFO L225 Difference]: With dead ends: 363 [2025-03-03 23:04:41,852 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 23:04:41,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:04:41,854 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 135 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:41,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:04:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 23:04:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2025-03-03 23:04:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 23:04:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions. [2025-03-03 23:04:41,903 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159 [2025-03-03 23:04:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 374 transitions. [2025-03-03 23:04:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:04:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions. [2025-03-03 23:04:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 23:04:41,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:41,906 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:04:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:04:41,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash 168322799, now seen corresponding path program 1 times [2025-03-03 23:04:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271714094] [2025-03-03 23:04:41,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:41,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 23:04:41,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 23:04:41,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:04:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271714094] [2025-03-03 23:04:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271714094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:04:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:04:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949732416] [2025-03-03 23:04:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:42,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:04:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:42,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:04:42,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:04:42,508 INFO L87 Difference]: Start difference. First operand 241 states and 374 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:04:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:43,600 INFO L93 Difference]: Finished difference Result 1170 states and 1802 transitions. [2025-03-03 23:04:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:04:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-03 23:04:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:43,609 INFO L225 Difference]: With dead ends: 1170 [2025-03-03 23:04:43,610 INFO L226 Difference]: Without dead ends: 1050 [2025-03-03 23:04:43,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:04:43,612 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1112 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:43,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1046 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:04:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-03 23:04:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 623. [2025-03-03 23:04:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 509 states have (on average 1.4852652259332024) internal successors, (756), 510 states have internal predecessors, (756), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:04:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 972 transitions. [2025-03-03 23:04:43,684 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 972 transitions. Word has length 160 [2025-03-03 23:04:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:43,685 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 972 transitions. [2025-03-03 23:04:43,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:04:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 972 transitions. [2025-03-03 23:04:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 23:04:43,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:43,689 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:04:43,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:04:43,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1606052237, now seen corresponding path program 1 times [2025-03-03 23:04:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931347109] [2025-03-03 23:04:43,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:43,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 23:04:43,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 23:04:43,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:43,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:05:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:04,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931347109] [2025-03-03 23:05:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931347109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:04,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:05:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692158474] [2025-03-03 23:05:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:04,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:05:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:04,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:05:04,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:05:04,277 INFO L87 Difference]: Start difference. First operand 623 states and 972 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:09,558 INFO L93 Difference]: Finished difference Result 1980 states and 3068 transitions. [2025-03-03 23:05:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:05:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-03 23:05:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:09,568 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 23:05:09,568 INFO L226 Difference]: Without dead ends: 1360 [2025-03-03 23:05:09,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:05:09,572 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 307 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:09,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 709 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 23:05:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-03 23:05:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 830. [2025-03-03 23:05:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 716 states have (on average 1.5223463687150838) internal successors, (1090), 717 states have internal predecessors, (1090), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:05:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1306 transitions. [2025-03-03 23:05:09,614 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1306 transitions. Word has length 160 [2025-03-03 23:05:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:09,615 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1306 transitions. [2025-03-03 23:05:09,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1306 transitions. [2025-03-03 23:05:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 23:05:09,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:09,618 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:09,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:05:09,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:09,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 650858770, now seen corresponding path program 1 times [2025-03-03 23:05:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141157301] [2025-03-03 23:05:09,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 23:05:09,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 23:05:09,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:09,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:05:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141157301] [2025-03-03 23:05:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141157301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:13,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:05:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124403451] [2025-03-03 23:05:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:13,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:05:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:13,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:05:13,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:05:13,299 INFO L87 Difference]: Start difference. First operand 830 states and 1306 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:15,546 INFO L93 Difference]: Finished difference Result 2329 states and 3626 transitions. [2025-03-03 23:05:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:05:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-03 23:05:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:15,553 INFO L225 Difference]: With dead ends: 2329 [2025-03-03 23:05:15,553 INFO L226 Difference]: Without dead ends: 1502 [2025-03-03 23:05:15,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:05:15,558 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 395 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:15,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 622 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 23:05:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-03 23:05:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 830. [2025-03-03 23:05:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 716 states have (on average 1.5223463687150838) internal successors, (1090), 717 states have internal predecessors, (1090), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:05:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1306 transitions. [2025-03-03 23:05:15,617 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1306 transitions. Word has length 160 [2025-03-03 23:05:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:15,617 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1306 transitions. [2025-03-03 23:05:15,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1306 transitions. [2025-03-03 23:05:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 23:05:15,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:15,620 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:05:15,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:15,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash -142433038, now seen corresponding path program 1 times [2025-03-03 23:05:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496905050] [2025-03-03 23:05:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 23:05:15,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 23:05:15,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:15,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:05:37,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496905050] [2025-03-03 23:05:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496905050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:05:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310213546] [2025-03-03 23:05:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:05:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:37,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:05:37,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:05:37,837 INFO L87 Difference]: Start difference. First operand 830 states and 1306 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:41,812 INFO L93 Difference]: Finished difference Result 2329 states and 3626 transitions. [2025-03-03 23:05:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:05:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-03 23:05:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:41,819 INFO L225 Difference]: With dead ends: 2329 [2025-03-03 23:05:41,819 INFO L226 Difference]: Without dead ends: 1502 [2025-03-03 23:05:41,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:05:41,822 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 305 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:41,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 646 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 23:05:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-03 23:05:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 835. [2025-03-03 23:05:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 721 states have (on average 1.5256588072122053) internal successors, (1100), 722 states have internal predecessors, (1100), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 23:05:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1316 transitions. [2025-03-03 23:05:41,877 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1316 transitions. Word has length 160 [2025-03-03 23:05:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:41,877 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1316 transitions. [2025-03-03 23:05:41,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1316 transitions. [2025-03-03 23:05:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 23:05:41,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:41,879 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:41,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:05:41,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:41,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2114477969, now seen corresponding path program 1 times [2025-03-03 23:05:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898081012] [2025-03-03 23:05:41,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:41,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 23:05:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 23:05:41,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:05:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898081012] [2025-03-03 23:05:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898081012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:05:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548232436] [2025-03-03 23:05:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:42,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:42,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:42,029 INFO L87 Difference]: Start difference. First operand 835 states and 1316 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:42,296 INFO L93 Difference]: Finished difference Result 3479 states and 5486 transitions. [2025-03-03 23:05:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:42,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-03 23:05:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:42,305 INFO L225 Difference]: With dead ends: 3479 [2025-03-03 23:05:42,305 INFO L226 Difference]: Without dead ends: 2647 [2025-03-03 23:05:42,308 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-03 23:05:42,308 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 464 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:42,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 889 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:05:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2025-03-03 23:05:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2366. [2025-03-03 23:05:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2099 states have (on average 1.5331110052405907) internal successors, (3218), 2106 states have internal predecessors, (3218), 251 states have call successors, (251), 15 states have call predecessors, (251), 15 states have return successors, (251), 244 states have call predecessors, (251), 251 states have call successors, (251) [2025-03-03 23:05:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3720 transitions. [2025-03-03 23:05:42,394 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3720 transitions. Word has length 160 [2025-03-03 23:05:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:42,395 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3720 transitions. [2025-03-03 23:05:42,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 23:05:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3720 transitions. [2025-03-03 23:05:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 23:05:42,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:42,398 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:05:42,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:05:42,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:42,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1065238425, now seen corresponding path program 1 times [2025-03-03 23:05:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290053834] [2025-03-03 23:05:42,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:42,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 23:05:42,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 23:05:42,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:06:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 23:06:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:06:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290053834] [2025-03-03 23:06:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290053834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:06:08,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:06:08,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 23:06:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696527443] [2025-03-03 23:06:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:06:08,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:06:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:06:08,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:06:08,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:06:08,913 INFO L87 Difference]: Start difference. First operand 2366 states and 3720 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)