./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/eca-rers2012/Problem15_label04.c -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 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:39:57,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:39:57,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:39:57,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:39:57,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:39:57,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:39:57,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:39:57,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:39:57,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:39:57,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:39:57,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:39:57,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:39:57,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:39:57,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:39:57,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:39:57,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:39:57,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:39:57,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:39:57,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:39:57,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:39:57,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:39:57,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:39:57,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:39:57,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:39:57,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:39:57,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:39:57,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:39:57,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:39:57,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:39:57,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:39:57,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:39:57,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:39:57,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:39:57,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:39:57,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:39:57,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:39:57,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:39:57,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 [2024-11-09 19:39:57,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:39:57,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:39:57,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:39:57,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:39:57,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:39:57,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2024-11-09 19:39:59,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:39:59,323 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:39:59,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2024-11-09 19:39:59,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0de263bc/ad9114e1daf4461d900680129a6ec318/FLAGb11fb54ee [2024-11-09 19:39:59,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0de263bc/ad9114e1daf4461d900680129a6ec318 [2024-11-09 19:39:59,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:39:59,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:39:59,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:39:59,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:39:59,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:39:59,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:59" (1/1) ... [2024-11-09 19:39:59,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c58901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:59, skipping insertion in model container [2024-11-09 19:39:59,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:59" (1/1) ... [2024-11-09 19:39:59,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:39:59,587 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/eca-rers2012/Problem15_label04.c[3915,3928] [2024-11-09 19:39:59,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:39:59,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:40:00,005 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/eca-rers2012/Problem15_label04.c[3915,3928] [2024-11-09 19:40:00,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:40:00,157 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:40:00,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00 WrapperNode [2024-11-09 19:40:00,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:40:00,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:40:00,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:40:00,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:40:00,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,327 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-09 19:40:00,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:40:00,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:40:00,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:40:00,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:40:00,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,411 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]. [2024-11-09 19:40:00,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:40:00,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:40:00,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:40:00,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:40:00,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (1/1) ... [2024-11-09 19:40:00,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:40:00,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:40:00,529 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) [2024-11-09 19:40:00,533 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 [2024-11-09 19:40:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:40:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:40:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:40:00,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:40:00,614 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:40:00,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:40:02,902 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-09 19:40:02,989 INFO L? ?]: Removed 697 outVars from TransFormulas that were not future-live. [2024-11-09 19:40:02,990 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:40:03,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:40:03,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:40:03,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:40:03 BoogieIcfgContainer [2024-11-09 19:40:03,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:40:03,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:40:03,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:40:03,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:40:03,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:39:59" (1/3) ... [2024-11-09 19:40:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdd0ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:40:03, skipping insertion in model container [2024-11-09 19:40:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:00" (2/3) ... [2024-11-09 19:40:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdd0ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:40:03, skipping insertion in model container [2024-11-09 19:40:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:40:03" (3/3) ... [2024-11-09 19:40:03,015 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label04.c [2024-11-09 19:40:03,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:40:03,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:40:03,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:40:03,102 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;@268e54d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:40:03,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:40:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 19:40:03,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:03,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:03,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:03,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 105307453, now seen corresponding path program 1 times [2024-11-09 19:40:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580695189] [2024-11-09 19:40:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:03,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580695189] [2024-11-09 19:40:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580695189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:03,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:03,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299092591] [2024-11-09 19:40:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:03,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:03,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:03,447 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:05,493 INFO L93 Difference]: Finished difference Result 1160 states and 2808 transitions. [2024-11-09 19:40:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 19:40:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:05,507 INFO L225 Difference]: With dead ends: 1160 [2024-11-09 19:40:05,508 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 19:40:05,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:05,514 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 522 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:05,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 388 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:40:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 19:40:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2024-11-09 19:40:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.177443609022556) internal successors, (1448), 665 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1448 transitions. [2024-11-09 19:40:05,583 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1448 transitions. Word has length 33 [2024-11-09 19:40:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:05,583 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1448 transitions. [2024-11-09 19:40:05,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1448 transitions. [2024-11-09 19:40:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 19:40:05,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:05,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:40:05,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1987921114, now seen corresponding path program 1 times [2024-11-09 19:40:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718872933] [2024-11-09 19:40:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:05,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:05,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718872933] [2024-11-09 19:40:05,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718872933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:05,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093312549] [2024-11-09 19:40:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:05,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:05,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:05,846 INFO L87 Difference]: Start difference. First operand 666 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:07,330 INFO L93 Difference]: Finished difference Result 1631 states and 3482 transitions. [2024-11-09 19:40:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-09 19:40:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:07,334 INFO L225 Difference]: With dead ends: 1631 [2024-11-09 19:40:07,334 INFO L226 Difference]: Without dead ends: 967 [2024-11-09 19:40:07,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:07,337 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 469 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:07,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 341 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-09 19:40:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-11-09 19:40:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.0817805383022776) internal successors, (2011), 966 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2011 transitions. [2024-11-09 19:40:07,358 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2011 transitions. Word has length 99 [2024-11-09 19:40:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 2011 transitions. [2024-11-09 19:40:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2011 transitions. [2024-11-09 19:40:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 19:40:07,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:07,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:40:07,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:07,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2127404619, now seen corresponding path program 1 times [2024-11-09 19:40:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289723971] [2024-11-09 19:40:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289723971] [2024-11-09 19:40:07,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289723971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940241658] [2024-11-09 19:40:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:07,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:07,529 INFO L87 Difference]: Start difference. First operand 967 states and 2011 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:09,198 INFO L93 Difference]: Finished difference Result 2238 states and 4819 transitions. [2024-11-09 19:40:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 19:40:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:09,210 INFO L225 Difference]: With dead ends: 2238 [2024-11-09 19:40:09,213 INFO L226 Difference]: Without dead ends: 1573 [2024-11-09 19:40:09,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:09,216 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 488 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:09,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 322 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:40:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-09 19:40:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1271. [2024-11-09 19:40:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.0338582677165356) internal successors, (2583), 1270 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2583 transitions. [2024-11-09 19:40:09,240 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2583 transitions. Word has length 104 [2024-11-09 19:40:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2583 transitions. [2024-11-09 19:40:09,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2583 transitions. [2024-11-09 19:40:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-09 19:40:09,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:09,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:09,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:40:09,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2034340870, now seen corresponding path program 1 times [2024-11-09 19:40:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129098211] [2024-11-09 19:40:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 19:40:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129098211] [2024-11-09 19:40:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129098211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510772805] [2024-11-09 19:40:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:09,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:09,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:09,461 INFO L87 Difference]: Start difference. First operand 1271 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:10,797 INFO L93 Difference]: Finished difference Result 3450 states and 7116 transitions. [2024-11-09 19:40:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2024-11-09 19:40:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:10,805 INFO L225 Difference]: With dead ends: 3450 [2024-11-09 19:40:10,805 INFO L226 Difference]: Without dead ends: 2181 [2024-11-09 19:40:10,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:10,810 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 490 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:10,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 344 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:40:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2024-11-09 19:40:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2176. [2024-11-09 19:40:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.9802298850574713) internal successors, (4307), 2175 states have internal predecessors, (4307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4307 transitions. [2024-11-09 19:40:10,845 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4307 transitions. Word has length 201 [2024-11-09 19:40:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:10,846 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 4307 transitions. [2024-11-09 19:40:10,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4307 transitions. [2024-11-09 19:40:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-09 19:40:10,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:10,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:40:10,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 447225516, now seen corresponding path program 1 times [2024-11-09 19:40:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937551834] [2024-11-09 19:40:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 19:40:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937551834] [2024-11-09 19:40:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937551834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:11,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:11,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20037350] [2024-11-09 19:40:11,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:11,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:11,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:11,376 INFO L87 Difference]: Start difference. First operand 2176 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:12,778 INFO L93 Difference]: Finished difference Result 4650 states and 9156 transitions. [2024-11-09 19:40:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2024-11-09 19:40:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:12,791 INFO L225 Difference]: With dead ends: 4650 [2024-11-09 19:40:12,791 INFO L226 Difference]: Without dead ends: 2476 [2024-11-09 19:40:12,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:12,795 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 337 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:12,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 363 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-11-09 19:40:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2024-11-09 19:40:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.9575757575757575) internal successors, (4845), 2475 states have internal predecessors, (4845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4845 transitions. [2024-11-09 19:40:12,836 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4845 transitions. Word has length 307 [2024-11-09 19:40:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:12,837 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4845 transitions. [2024-11-09 19:40:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4845 transitions. [2024-11-09 19:40:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-09 19:40:12,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:12,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:40:12,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -128684913, now seen corresponding path program 1 times [2024-11-09 19:40:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073943788] [2024-11-09 19:40:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:40:13,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073943788] [2024-11-09 19:40:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073943788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082573130] [2024-11-09 19:40:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:13,063 INFO L87 Difference]: Start difference. First operand 2476 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:14,929 INFO L93 Difference]: Finished difference Result 5251 states and 10505 transitions. [2024-11-09 19:40:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2024-11-09 19:40:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:14,941 INFO L225 Difference]: With dead ends: 5251 [2024-11-09 19:40:14,942 INFO L226 Difference]: Without dead ends: 3077 [2024-11-09 19:40:14,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:14,945 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 516 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:14,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 327 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:40:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2024-11-09 19:40:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2173. [2024-11-09 19:40:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2172 states have (on average 1.977900552486188) internal successors, (4296), 2172 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 4296 transitions. [2024-11-09 19:40:15,002 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 4296 transitions. Word has length 322 [2024-11-09 19:40:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:15,002 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 4296 transitions. [2024-11-09 19:40:15,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 4296 transitions. [2024-11-09 19:40:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-09 19:40:15,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:15,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:15,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:40:15,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:15,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash -392292229, now seen corresponding path program 1 times [2024-11-09 19:40:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:15,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043277854] [2024-11-09 19:40:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:40:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043277854] [2024-11-09 19:40:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043277854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029634471] [2024-11-09 19:40:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:15,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:15,298 INFO L87 Difference]: Start difference. First operand 2173 states and 4296 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:16,806 INFO L93 Difference]: Finished difference Result 5254 states and 10588 transitions. [2024-11-09 19:40:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:16,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2024-11-09 19:40:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:16,820 INFO L225 Difference]: With dead ends: 5254 [2024-11-09 19:40:16,820 INFO L226 Difference]: Without dead ends: 3383 [2024-11-09 19:40:16,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:16,825 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 529 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:16,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 873 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:40:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2024-11-09 19:40:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3083. [2024-11-09 19:40:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3082 states have (on average 1.9383517196625568) internal successors, (5974), 3082 states have internal predecessors, (5974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5974 transitions. [2024-11-09 19:40:16,869 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5974 transitions. Word has length 381 [2024-11-09 19:40:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:16,870 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 5974 transitions. [2024-11-09 19:40:16,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5974 transitions. [2024-11-09 19:40:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-09 19:40:16,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:16,873 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:40:16,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1027720861, now seen corresponding path program 1 times [2024-11-09 19:40:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289428378] [2024-11-09 19:40:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289428378] [2024-11-09 19:40:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289428378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706317667] [2024-11-09 19:40:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:17,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:17,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:17,108 INFO L87 Difference]: Start difference. First operand 3083 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:18,606 INFO L93 Difference]: Finished difference Result 7075 states and 13950 transitions. [2024-11-09 19:40:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:18,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2024-11-09 19:40:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:18,620 INFO L225 Difference]: With dead ends: 7075 [2024-11-09 19:40:18,620 INFO L226 Difference]: Without dead ends: 4294 [2024-11-09 19:40:18,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:18,624 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 482 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:18,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 838 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2024-11-09 19:40:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 4291. [2024-11-09 19:40:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4291 states, 4290 states have (on average 1.913986013986014) internal successors, (8211), 4290 states have internal predecessors, (8211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 8211 transitions. [2024-11-09 19:40:18,685 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 8211 transitions. Word has length 386 [2024-11-09 19:40:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:18,685 INFO L471 AbstractCegarLoop]: Abstraction has 4291 states and 8211 transitions. [2024-11-09 19:40:18,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 8211 transitions. [2024-11-09 19:40:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-09 19:40:18,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:18,689 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:18,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:40:18,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 783585357, now seen corresponding path program 1 times [2024-11-09 19:40:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142588715] [2024-11-09 19:40:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:40:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142588715] [2024-11-09 19:40:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142588715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:18,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844138786] [2024-11-09 19:40:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:18,903 INFO L87 Difference]: Start difference. First operand 4291 states and 8211 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:20,360 INFO L93 Difference]: Finished difference Result 9481 states and 18412 transitions. [2024-11-09 19:40:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2024-11-09 19:40:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:20,384 INFO L225 Difference]: With dead ends: 9481 [2024-11-09 19:40:20,384 INFO L226 Difference]: Without dead ends: 5492 [2024-11-09 19:40:20,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:20,391 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 477 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:20,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 855 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2024-11-09 19:40:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5189. [2024-11-09 19:40:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5188 states have (on average 1.9069005397070162) internal successors, (9893), 5188 states have internal predecessors, (9893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 9893 transitions. [2024-11-09 19:40:20,468 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 9893 transitions. Word has length 404 [2024-11-09 19:40:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:20,469 INFO L471 AbstractCegarLoop]: Abstraction has 5189 states and 9893 transitions. [2024-11-09 19:40:20,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 9893 transitions. [2024-11-09 19:40:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-11-09 19:40:20,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:20,475 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:20,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:40:20,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:20,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1320707969, now seen corresponding path program 1 times [2024-11-09 19:40:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469220005] [2024-11-09 19:40:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-09 19:40:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469220005] [2024-11-09 19:40:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469220005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:20,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398253287] [2024-11-09 19:40:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:20,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:20,672 INFO L87 Difference]: Start difference. First operand 5189 states and 9893 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:22,148 INFO L93 Difference]: Finished difference Result 11575 states and 22363 transitions. [2024-11-09 19:40:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:22,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 500 [2024-11-09 19:40:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:22,160 INFO L225 Difference]: With dead ends: 11575 [2024-11-09 19:40:22,160 INFO L226 Difference]: Without dead ends: 6688 [2024-11-09 19:40:22,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:22,166 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 616 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:22,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 684 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2024-11-09 19:40:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 6688. [2024-11-09 19:40:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 1.9289666517122777) internal successors, (12899), 6687 states have internal predecessors, (12899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 12899 transitions. [2024-11-09 19:40:22,262 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 12899 transitions. Word has length 500 [2024-11-09 19:40:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:22,263 INFO L471 AbstractCegarLoop]: Abstraction has 6688 states and 12899 transitions. [2024-11-09 19:40:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 12899 transitions. [2024-11-09 19:40:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-09 19:40:22,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:22,267 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:22,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:40:22,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash 641802461, now seen corresponding path program 1 times [2024-11-09 19:40:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769724807] [2024-11-09 19:40:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-09 19:40:22,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:22,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769724807] [2024-11-09 19:40:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769724807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:22,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:22,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:22,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230745746] [2024-11-09 19:40:22,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:22,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:22,646 INFO L87 Difference]: Start difference. First operand 6688 states and 12899 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:24,146 INFO L93 Difference]: Finished difference Result 18188 states and 35225 transitions. [2024-11-09 19:40:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2024-11-09 19:40:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:24,167 INFO L225 Difference]: With dead ends: 18188 [2024-11-09 19:40:24,167 INFO L226 Difference]: Without dead ends: 11802 [2024-11-09 19:40:24,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:24,175 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 478 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:24,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 858 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2024-11-09 19:40:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 11191. [2024-11-09 19:40:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11191 states, 11190 states have (on average 1.9041108132260947) internal successors, (21307), 11190 states have internal predecessors, (21307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 21307 transitions. [2024-11-09 19:40:24,306 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 21307 transitions. Word has length 525 [2024-11-09 19:40:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 11191 states and 21307 transitions. [2024-11-09 19:40:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 21307 transitions. [2024-11-09 19:40:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2024-11-09 19:40:24,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:24,313 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:40:24,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1028112450, now seen corresponding path program 1 times [2024-11-09 19:40:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84708893] [2024-11-09 19:40:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 19:40:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84708893] [2024-11-09 19:40:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84708893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:40:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257583346] [2024-11-09 19:40:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:40:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:40:24,869 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) [2024-11-09 19:40:24,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:40:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:25,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:40:25,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:40:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 19:40:25,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:40:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 19:40:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257583346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:40:26,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:40:26,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 19:40:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401348183] [2024-11-09 19:40:26,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:40:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 19:40:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:26,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 19:40:26,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:40:26,409 INFO L87 Difference]: Start difference. First operand 11191 states and 21307 transitions. Second operand has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:32,874 INFO L93 Difference]: Finished difference Result 29546 states and 55905 transitions. [2024-11-09 19:40:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 19:40:32,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2024-11-09 19:40:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:32,897 INFO L225 Difference]: With dead ends: 29546 [2024-11-09 19:40:32,897 INFO L226 Difference]: Without dead ends: 13592 [2024-11-09 19:40:32,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-09 19:40:32,906 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 5871 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 9063 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5871 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 9769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 9063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:32,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5871 Valid, 262 Invalid, 9769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 9063 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 19:40:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13592 states. [2024-11-09 19:40:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13592 to 10589. [2024-11-09 19:40:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10589 states, 10588 states have (on average 1.837551945598791) internal successors, (19456), 10588 states have internal predecessors, (19456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 19456 transitions. [2024-11-09 19:40:33,036 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 19456 transitions. Word has length 592 [2024-11-09 19:40:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:33,037 INFO L471 AbstractCegarLoop]: Abstraction has 10589 states and 19456 transitions. [2024-11-09 19:40:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.66666666666667) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 19456 transitions. [2024-11-09 19:40:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2024-11-09 19:40:33,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:33,043 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:33,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:40:33,243 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,SelfDestructingSolverStorable11 [2024-11-09 19:40:33,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1606727866, now seen corresponding path program 1 times [2024-11-09 19:40:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368432387] [2024-11-09 19:40:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-11-09 19:40:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368432387] [2024-11-09 19:40:33,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368432387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:33,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:33,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723844417] [2024-11-09 19:40:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:33,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:33,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:33,540 INFO L87 Difference]: Start difference. First operand 10589 states and 19456 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:34,557 INFO L93 Difference]: Finished difference Result 21174 states and 38920 transitions. [2024-11-09 19:40:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:34,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 617 [2024-11-09 19:40:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:34,572 INFO L225 Difference]: With dead ends: 21174 [2024-11-09 19:40:34,572 INFO L226 Difference]: Without dead ends: 10887 [2024-11-09 19:40:34,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:34,581 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 671 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:34,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 72 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:40:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2024-11-09 19:40:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10587. [2024-11-09 19:40:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10587 states, 10586 states have (on average 1.8375212544870583) internal successors, (19452), 10586 states have internal predecessors, (19452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10587 states to 10587 states and 19452 transitions. [2024-11-09 19:40:34,698 INFO L78 Accepts]: Start accepts. Automaton has 10587 states and 19452 transitions. Word has length 617 [2024-11-09 19:40:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:34,699 INFO L471 AbstractCegarLoop]: Abstraction has 10587 states and 19452 transitions. [2024-11-09 19:40:34,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 10587 states and 19452 transitions. [2024-11-09 19:40:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-11-09 19:40:34,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:34,704 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:34,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:40:34,705 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:34,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash -486660653, now seen corresponding path program 1 times [2024-11-09 19:40:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:34,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180008287] [2024-11-09 19:40:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:40:35,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:35,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180008287] [2024-11-09 19:40:35,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180008287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:35,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:35,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849535154] [2024-11-09 19:40:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:35,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:35,360 INFO L87 Difference]: Start difference. First operand 10587 states and 19452 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:36,351 INFO L93 Difference]: Finished difference Result 21178 states and 38909 transitions. [2024-11-09 19:40:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 637 [2024-11-09 19:40:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:36,365 INFO L225 Difference]: With dead ends: 21178 [2024-11-09 19:40:36,365 INFO L226 Difference]: Without dead ends: 10593 [2024-11-09 19:40:36,371 INFO L431 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 [2024-11-09 19:40:36,372 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 576 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:36,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 143 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:40:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10593 states. [2024-11-09 19:40:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10593 to 9987. [2024-11-09 19:40:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9987 states, 9986 states have (on average 1.8229521329861806) internal successors, (18204), 9986 states have internal predecessors, (18204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9987 states to 9987 states and 18204 transitions. [2024-11-09 19:40:36,526 INFO L78 Accepts]: Start accepts. Automaton has 9987 states and 18204 transitions. Word has length 637 [2024-11-09 19:40:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:36,527 INFO L471 AbstractCegarLoop]: Abstraction has 9987 states and 18204 transitions. [2024-11-09 19:40:36,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 9987 states and 18204 transitions. [2024-11-09 19:40:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2024-11-09 19:40:36,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:36,537 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:36,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:40:36,537 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1405610277, now seen corresponding path program 1 times [2024-11-09 19:40:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230047635] [2024-11-09 19:40:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2024-11-09 19:40:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230047635] [2024-11-09 19:40:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230047635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504512357] [2024-11-09 19:40:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:36,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:36,877 INFO L87 Difference]: Start difference. First operand 9987 states and 18204 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:38,034 INFO L93 Difference]: Finished difference Result 22970 states and 41934 transitions. [2024-11-09 19:40:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 661 [2024-11-09 19:40:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:38,049 INFO L225 Difference]: With dead ends: 22970 [2024-11-09 19:40:38,049 INFO L226 Difference]: Without dead ends: 12985 [2024-11-09 19:40:38,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:38,057 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 537 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:38,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 187 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:40:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12985 states. [2024-11-09 19:40:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12985 to 11785. [2024-11-09 19:40:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11785 states, 11784 states have (on average 1.8178886625933468) internal successors, (21422), 11784 states have internal predecessors, (21422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11785 states to 11785 states and 21422 transitions. [2024-11-09 19:40:38,212 INFO L78 Accepts]: Start accepts. Automaton has 11785 states and 21422 transitions. Word has length 661 [2024-11-09 19:40:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:38,212 INFO L471 AbstractCegarLoop]: Abstraction has 11785 states and 21422 transitions. [2024-11-09 19:40:38,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11785 states and 21422 transitions. [2024-11-09 19:40:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-11-09 19:40:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:38,220 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:38,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:40:38,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:38,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash -534274703, now seen corresponding path program 1 times [2024-11-09 19:40:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:38,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459932759] [2024-11-09 19:40:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 537 proven. 192 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 19:40:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459932759] [2024-11-09 19:40:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459932759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:40:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265337707] [2024-11-09 19:40:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:40:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:40:38,775 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) [2024-11-09 19:40:38,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:40:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:38,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:40:38,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:40:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-09 19:40:39,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:40:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265337707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:40:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:40:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936709111] [2024-11-09 19:40:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:39,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:39,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:40:39,181 INFO L87 Difference]: Start difference. First operand 11785 states and 21422 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:40,378 INFO L93 Difference]: Finished difference Result 28091 states and 51142 transitions. [2024-11-09 19:40:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 669 [2024-11-09 19:40:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:40,398 INFO L225 Difference]: With dead ends: 28091 [2024-11-09 19:40:40,399 INFO L226 Difference]: Without dead ends: 16308 [2024-11-09 19:40:40,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:40:40,408 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 541 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:40,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 718 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:40:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16308 states. [2024-11-09 19:40:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16308 to 16297. [2024-11-09 19:40:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16297 states, 16296 states have (on average 1.817685321551301) internal successors, (29621), 16296 states have internal predecessors, (29621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16297 states to 16297 states and 29621 transitions. [2024-11-09 19:40:40,556 INFO L78 Accepts]: Start accepts. Automaton has 16297 states and 29621 transitions. Word has length 669 [2024-11-09 19:40:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:40,556 INFO L471 AbstractCegarLoop]: Abstraction has 16297 states and 29621 transitions. [2024-11-09 19:40:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 16297 states and 29621 transitions. [2024-11-09 19:40:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-11-09 19:40:40,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:40,564 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:40,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:40:40,764 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,SelfDestructingSolverStorable15 [2024-11-09 19:40:40,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:40,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1334308697, now seen corresponding path program 1 times [2024-11-09 19:40:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145695656] [2024-11-09 19:40:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:40:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145695656] [2024-11-09 19:40:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145695656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996815367] [2024-11-09 19:40:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:41,194 INFO L87 Difference]: Start difference. First operand 16297 states and 29621 transitions. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:42,373 INFO L93 Difference]: Finished difference Result 37993 states and 69194 transitions. [2024-11-09 19:40:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 702 [2024-11-09 19:40:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:42,398 INFO L225 Difference]: With dead ends: 37993 [2024-11-09 19:40:42,398 INFO L226 Difference]: Without dead ends: 21698 [2024-11-09 19:40:42,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:42,409 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 297 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:42,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 161 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:40:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21698 states. [2024-11-09 19:40:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21698 to 19898. [2024-11-09 19:40:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19898 states, 19897 states have (on average 1.8187163894054381) internal successors, (36187), 19897 states have internal predecessors, (36187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19898 states to 19898 states and 36187 transitions. [2024-11-09 19:40:42,744 INFO L78 Accepts]: Start accepts. Automaton has 19898 states and 36187 transitions. Word has length 702 [2024-11-09 19:40:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:42,745 INFO L471 AbstractCegarLoop]: Abstraction has 19898 states and 36187 transitions. [2024-11-09 19:40:42,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19898 states and 36187 transitions. [2024-11-09 19:40:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2024-11-09 19:40:42,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:42,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:42,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:40:42,758 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1210496885, now seen corresponding path program 1 times [2024-11-09 19:40:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456508524] [2024-11-09 19:40:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2024-11-09 19:40:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456508524] [2024-11-09 19:40:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456508524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:43,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:43,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069986963] [2024-11-09 19:40:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:43,224 INFO L87 Difference]: Start difference. First operand 19898 states and 36187 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:44,325 INFO L93 Difference]: Finished difference Result 43113 states and 78422 transitions. [2024-11-09 19:40:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:44,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 719 [2024-11-09 19:40:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:44,472 INFO L225 Difference]: With dead ends: 43113 [2024-11-09 19:40:44,473 INFO L226 Difference]: Without dead ends: 23217 [2024-11-09 19:40:44,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:44,482 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 525 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:44,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 767 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:40:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23217 states. [2024-11-09 19:40:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23217 to 22609. [2024-11-09 19:40:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22609 states, 22608 states have (on average 1.8164366595895258) internal successors, (41066), 22608 states have internal predecessors, (41066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22609 states to 22609 states and 41066 transitions. [2024-11-09 19:40:44,682 INFO L78 Accepts]: Start accepts. Automaton has 22609 states and 41066 transitions. Word has length 719 [2024-11-09 19:40:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:44,683 INFO L471 AbstractCegarLoop]: Abstraction has 22609 states and 41066 transitions. [2024-11-09 19:40:44,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22609 states and 41066 transitions. [2024-11-09 19:40:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2024-11-09 19:40:44,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:44,692 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:44,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:40:44,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:44,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash -607323063, now seen corresponding path program 1 times [2024-11-09 19:40:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098288114] [2024-11-09 19:40:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-09 19:40:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098288114] [2024-11-09 19:40:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098288114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:45,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481699206] [2024-11-09 19:40:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:45,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:45,233 INFO L87 Difference]: Start difference. First operand 22609 states and 41066 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:46,261 INFO L93 Difference]: Finished difference Result 48831 states and 88825 transitions. [2024-11-09 19:40:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2024-11-09 19:40:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:46,291 INFO L225 Difference]: With dead ends: 48831 [2024-11-09 19:40:46,291 INFO L226 Difference]: Without dead ends: 26524 [2024-11-09 19:40:46,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:46,306 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 405 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:46,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 782 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:40:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2024-11-09 19:40:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 25623. [2024-11-09 19:40:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25623 states, 25622 states have (on average 1.8141440949184295) internal successors, (46482), 25622 states have internal predecessors, (46482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 46482 transitions. [2024-11-09 19:40:46,577 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 46482 transitions. Word has length 733 [2024-11-09 19:40:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:46,577 INFO L471 AbstractCegarLoop]: Abstraction has 25623 states and 46482 transitions. [2024-11-09 19:40:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 46482 transitions. [2024-11-09 19:40:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-11-09 19:40:46,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:46,590 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:40:46,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 482328256, now seen corresponding path program 1 times [2024-11-09 19:40:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362192207] [2024-11-09 19:40:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-11-09 19:40:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362192207] [2024-11-09 19:40:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362192207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:47,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:40:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292283150] [2024-11-09 19:40:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:47,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:40:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:40:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:47,069 INFO L87 Difference]: Start difference. First operand 25623 states and 46482 transitions. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:48,829 INFO L93 Difference]: Finished difference Result 52740 states and 95684 transitions. [2024-11-09 19:40:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:40:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 796 [2024-11-09 19:40:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:48,861 INFO L225 Difference]: With dead ends: 52740 [2024-11-09 19:40:48,861 INFO L226 Difference]: Without dead ends: 27419 [2024-11-09 19:40:48,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:48,877 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1052 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:48,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 673 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:40:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27419 states. [2024-11-09 19:40:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27419 to 26518. [2024-11-09 19:40:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26518 states, 26517 states have (on average 1.805709544820304) internal successors, (47882), 26517 states have internal predecessors, (47882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26518 states to 26518 states and 47882 transitions. [2024-11-09 19:40:49,134 INFO L78 Accepts]: Start accepts. Automaton has 26518 states and 47882 transitions. Word has length 796 [2024-11-09 19:40:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:49,134 INFO L471 AbstractCegarLoop]: Abstraction has 26518 states and 47882 transitions. [2024-11-09 19:40:49,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 26518 states and 47882 transitions. [2024-11-09 19:40:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2024-11-09 19:40:49,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:49,148 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:49,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:40:49,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -157237503, now seen corresponding path program 1 times [2024-11-09 19:40:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461956140] [2024-11-09 19:40:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-09 19:40:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461956140] [2024-11-09 19:40:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461956140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931506341] [2024-11-09 19:40:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:49,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:49,788 INFO L87 Difference]: Start difference. First operand 26518 states and 47882 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:50,938 INFO L93 Difference]: Finished difference Result 51822 states and 93590 transitions. [2024-11-09 19:40:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:50,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 836 [2024-11-09 19:40:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:50,979 INFO L225 Difference]: With dead ends: 51822 [2024-11-09 19:40:50,979 INFO L226 Difference]: Without dead ends: 25606 [2024-11-09 19:40:50,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:50,996 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 408 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:50,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 737 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:40:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25606 states. [2024-11-09 19:40:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25606 to 24402. [2024-11-09 19:40:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24402 states, 24401 states have (on average 1.7937379615589526) internal successors, (43769), 24401 states have internal predecessors, (43769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24402 states to 24402 states and 43769 transitions. [2024-11-09 19:40:51,301 INFO L78 Accepts]: Start accepts. Automaton has 24402 states and 43769 transitions. Word has length 836 [2024-11-09 19:40:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:51,302 INFO L471 AbstractCegarLoop]: Abstraction has 24402 states and 43769 transitions. [2024-11-09 19:40:51,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24402 states and 43769 transitions. [2024-11-09 19:40:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2024-11-09 19:40:51,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:51,317 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:40:51,317 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1221445752, now seen corresponding path program 1 times [2024-11-09 19:40:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:51,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617448330] [2024-11-09 19:40:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 1035 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-09 19:40:51,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617448330] [2024-11-09 19:40:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617448330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:51,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993715965] [2024-11-09 19:40:51,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:51,854 INFO L87 Difference]: Start difference. First operand 24402 states and 43769 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:52,939 INFO L93 Difference]: Finished difference Result 53320 states and 95665 transitions. [2024-11-09 19:40:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 932 [2024-11-09 19:40:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:52,972 INFO L225 Difference]: With dead ends: 53320 [2024-11-09 19:40:52,973 INFO L226 Difference]: Without dead ends: 29220 [2024-11-09 19:40:52,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:52,990 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 580 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:52,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 123 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:40:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29220 states. [2024-11-09 19:40:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29220 to 25000. [2024-11-09 19:40:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25000 states, 24999 states have (on average 1.7923116924676987) internal successors, (44806), 24999 states have internal predecessors, (44806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25000 states to 25000 states and 44806 transitions. [2024-11-09 19:40:53,240 INFO L78 Accepts]: Start accepts. Automaton has 25000 states and 44806 transitions. Word has length 932 [2024-11-09 19:40:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 25000 states and 44806 transitions. [2024-11-09 19:40:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 25000 states and 44806 transitions. [2024-11-09 19:40:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2024-11-09 19:40:53,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:53,255 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 19:40:53,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2070597243, now seen corresponding path program 1 times [2024-11-09 19:40:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059472535] [2024-11-09 19:40:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-09 19:40:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059472535] [2024-11-09 19:40:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059472535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:40:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100603760] [2024-11-09 19:40:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:40:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:40:53,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:53,674 INFO L87 Difference]: Start difference. First operand 25000 states and 44806 transitions. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:55,177 INFO L93 Difference]: Finished difference Result 54203 states and 97171 transitions. [2024-11-09 19:40:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:40:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 933 [2024-11-09 19:40:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:55,209 INFO L225 Difference]: With dead ends: 54203 [2024-11-09 19:40:55,209 INFO L226 Difference]: Without dead ends: 29505 [2024-11-09 19:40:55,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:55,224 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 849 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:55,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 161 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1893 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:40:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29505 states. [2024-11-09 19:40:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29505 to 24698. [2024-11-09 19:40:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24698 states, 24697 states have (on average 1.792241972709236) internal successors, (44263), 24697 states have internal predecessors, (44263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24698 states to 24698 states and 44263 transitions. [2024-11-09 19:40:55,482 INFO L78 Accepts]: Start accepts. Automaton has 24698 states and 44263 transitions. Word has length 933 [2024-11-09 19:40:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:55,483 INFO L471 AbstractCegarLoop]: Abstraction has 24698 states and 44263 transitions. [2024-11-09 19:40:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24698 states and 44263 transitions. [2024-11-09 19:40:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2024-11-09 19:40:55,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:55,500 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:55,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 19:40:55,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:55,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 69569425, now seen corresponding path program 1 times [2024-11-09 19:40:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181146443] [2024-11-09 19:40:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-11-09 19:40:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181146443] [2024-11-09 19:40:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181146443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:56,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190902973] [2024-11-09 19:40:56,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:56,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:56,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:56,005 INFO L87 Difference]: Start difference. First operand 24698 states and 44263 transitions. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:57,131 INFO L93 Difference]: Finished difference Result 52400 states and 93915 transitions. [2024-11-09 19:40:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 969 [2024-11-09 19:40:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:57,163 INFO L225 Difference]: With dead ends: 52400 [2024-11-09 19:40:57,163 INFO L226 Difference]: Without dead ends: 28004 [2024-11-09 19:40:57,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:57,175 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 294 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:57,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 177 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:40:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28004 states. [2024-11-09 19:40:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28004 to 25595. [2024-11-09 19:40:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25595 states, 25594 states have (on average 1.7917871376103773) internal successors, (45859), 25594 states have internal predecessors, (45859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25595 states to 25595 states and 45859 transitions. [2024-11-09 19:40:57,409 INFO L78 Accepts]: Start accepts. Automaton has 25595 states and 45859 transitions. Word has length 969 [2024-11-09 19:40:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:57,409 INFO L471 AbstractCegarLoop]: Abstraction has 25595 states and 45859 transitions. [2024-11-09 19:40:57,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25595 states and 45859 transitions. [2024-11-09 19:40:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2024-11-09 19:40:57,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:57,427 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:57,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 19:40:57,427 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1367140711, now seen corresponding path program 1 times [2024-11-09 19:40:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295023973] [2024-11-09 19:40:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1616 proven. 0 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-09 19:40:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295023973] [2024-11-09 19:40:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295023973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:57,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:40:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463257492] [2024-11-09 19:40:57,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:57,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:40:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:40:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:57,998 INFO L87 Difference]: Start difference. First operand 25595 states and 45859 transitions. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:40:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:59,688 INFO L93 Difference]: Finished difference Result 55994 states and 100322 transitions. [2024-11-09 19:40:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:40:59,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1020 [2024-11-09 19:40:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:59,727 INFO L225 Difference]: With dead ends: 55994 [2024-11-09 19:40:59,727 INFO L226 Difference]: Without dead ends: 27993 [2024-11-09 19:40:59,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:40:59,744 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 969 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:59,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 133 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:40:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27993 states. [2024-11-09 19:41:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27993 to 22284. [2024-11-09 19:41:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22284 states, 22283 states have (on average 1.7904680698290176) internal successors, (39897), 22283 states have internal predecessors, (39897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 39897 transitions. [2024-11-09 19:41:00,100 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 39897 transitions. Word has length 1020 [2024-11-09 19:41:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:00,101 INFO L471 AbstractCegarLoop]: Abstraction has 22284 states and 39897 transitions. [2024-11-09 19:41:00,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 39897 transitions. [2024-11-09 19:41:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2024-11-09 19:41:00,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:00,131 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:00,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 19:41:00,131 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:00,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1971473283, now seen corresponding path program 1 times [2024-11-09 19:41:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568184149] [2024-11-09 19:41:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 119 proven. 760 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-09 19:41:00,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:00,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568184149] [2024-11-09 19:41:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568184149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:41:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169894164] [2024-11-09 19:41:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:00,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:00,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:00,910 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) [2024-11-09 19:41:00,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:41:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:01,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:41:01,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:41:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 119 proven. 760 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-09 19:41:05,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:41:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 119 proven. 760 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-09 19:41:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169894164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:41:06,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:41:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 19:41:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896499659] [2024-11-09 19:41:06,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:41:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 19:41:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 19:41:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:41:06,445 INFO L87 Difference]: Start difference. First operand 22284 states and 39897 transitions. Second operand has 10 states, 10 states have (on average 145.0) internal successors, (1450), 9 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:10,288 INFO L93 Difference]: Finished difference Result 37624 states and 67421 transitions. [2024-11-09 19:41:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 19:41:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 145.0) internal successors, (1450), 9 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1065 [2024-11-09 19:41:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:10,328 INFO L225 Difference]: With dead ends: 37624 [2024-11-09 19:41:10,328 INFO L226 Difference]: Without dead ends: 37621 [2024-11-09 19:41:10,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2132 GetRequests, 2124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-09 19:41:10,336 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 5601 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 5298 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5601 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 5728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 5298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5601 Valid, 202 Invalid, 5728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 5298 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:41:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37621 states. [2024-11-09 19:41:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37621 to 21984. [2024-11-09 19:41:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21984 states, 21983 states have (on average 1.7904289678387846) internal successors, (39359), 21983 states have internal predecessors, (39359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21984 states to 21984 states and 39359 transitions. [2024-11-09 19:41:10,608 INFO L78 Accepts]: Start accepts. Automaton has 21984 states and 39359 transitions. Word has length 1065 [2024-11-09 19:41:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:10,608 INFO L471 AbstractCegarLoop]: Abstraction has 21984 states and 39359 transitions. [2024-11-09 19:41:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 145.0) internal successors, (1450), 9 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 21984 states and 39359 transitions. [2024-11-09 19:41:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2024-11-09 19:41:10,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:10,630 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:10,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:41:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:10,831 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -292886686, now seen corresponding path program 1 times [2024-11-09 19:41:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787447982] [2024-11-09 19:41:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3522 backedges. 1611 proven. 189 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-11-09 19:41:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787447982] [2024-11-09 19:41:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787447982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:41:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867800132] [2024-11-09 19:41:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:12,207 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) [2024-11-09 19:41:12,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:41:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:12,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 1503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:41:12,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:41:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3522 backedges. 2364 proven. 0 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-11-09 19:41:12,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:41:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867800132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:41:12,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:41:12,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544673129] [2024-11-09 19:41:12,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:12,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:41:12,652 INFO L87 Difference]: Start difference. First operand 21984 states and 39359 transitions. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:13,551 INFO L93 Difference]: Finished difference Result 37028 states and 66322 transitions. [2024-11-09 19:41:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1279 [2024-11-09 19:41:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:13,553 INFO L225 Difference]: With dead ends: 37028 [2024-11-09 19:41:13,553 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:41:13,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1282 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:41:13,563 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 460 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:13,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 595 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:41:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:41:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:41:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:41:13,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1279 [2024-11-09 19:41:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:13,564 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:41:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:41:13,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:41:13,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:41:13,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 19:41:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 19:41:13,771 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:13,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:41:18,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:41:18,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:41:18 BoogieIcfgContainer [2024-11-09 19:41:19,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:41:19,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:41:19,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:41:19,002 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:41:19,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:40:03" (3/4) ... [2024-11-09 19:41:19,007 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:41:19,038 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 19:41:19,041 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:41:19,043 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:41:19,046 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:41:19,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:41:19,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:41:19,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:41:19,234 INFO L158 Benchmark]: Toolchain (without parser) took 79870.87ms. Allocated memory was 176.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 112.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-09 19:41:19,234 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:41:19,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 792.99ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 112.0MB in the beginning and 187.8MB in the end (delta: -75.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-11-09 19:41:19,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 169.23ms. Allocated memory is still 264.2MB. Free memory was 187.8MB in the beginning and 150.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 19:41:19,235 INFO L158 Benchmark]: Boogie Preprocessor took 170.01ms. Allocated memory is still 264.2MB. Free memory was 150.0MB in the beginning and 93.7MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-09 19:41:19,235 INFO L158 Benchmark]: IcfgBuilder took 2510.21ms. Allocated memory was 264.2MB in the beginning and 438.3MB in the end (delta: 174.1MB). Free memory was 93.7MB in the beginning and 278.7MB in the end (delta: -185.0MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-11-09 19:41:19,235 INFO L158 Benchmark]: TraceAbstraction took 75990.94ms. Allocated memory was 438.3MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 277.6MB in the beginning and 1.2GB in the end (delta: -929.5MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-09 19:41:19,235 INFO L158 Benchmark]: Witness Printer took 231.80ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 19:41:19,236 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 792.99ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 112.0MB in the beginning and 187.8MB in the end (delta: -75.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 169.23ms. Allocated memory is still 264.2MB. Free memory was 187.8MB in the beginning and 150.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 170.01ms. Allocated memory is still 264.2MB. Free memory was 150.0MB in the beginning and 93.7MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2510.21ms. Allocated memory was 264.2MB in the beginning and 438.3MB in the end (delta: 174.1MB). Free memory was 93.7MB in the beginning and 278.7MB in the end (delta: -185.0MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * TraceAbstraction took 75990.94ms. Allocated memory was 438.3MB in the beginning and 2.5GB in the end (delta: 2.0GB). Free memory was 277.6MB in the beginning and 1.2GB in the end (delta: -929.5MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 231.80ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 427 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.7s, OverallIterations: 27, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 45.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25040 SdHoareTripleChecker+Valid, 41.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25040 mSDsluCounter, 12086 SdHoareTripleChecker+Invalid, 34.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 4580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50227 IncrementalHoareTripleChecker+Invalid, 54807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4580 mSolverCounterUnsat, 10854 mSDtfsCounter, 50227 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5348 GetRequests, 5292 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26518occurred in iteration=20, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 45746 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 20027 NumberOfCodeBlocks, 20027 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 21651 ConstructedInterpolants, 299 QuantifiedInterpolants, 72412 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4243 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 28435/31213 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:41:19,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0