./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/Problem18_label58.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 be46f37b21ca1efe6aa6939661dfa8a9a0b05dac2f573e189e36e956003b5dd8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:59:27,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:59:27,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:59:27,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:59:27,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:59:27,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:59:27,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:59:27,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:59:27,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:59:27,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:59:27,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:59:27,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:59:27,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:59:27,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:59:27,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:59:27,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:59:27,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:59:27,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:59:27,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:59:27,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:59:27,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:59:27,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:59:27,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:59:27,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:59:27,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:59:27,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:59:27,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:59:27,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:59:27,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:59:27,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:59:27,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:59:27,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:59:27,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:59:27,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:59:27,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:59:27,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:59:27,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:59:27,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:59:27,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:59:27,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:59:27,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:59:27,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:59:27,723 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 -> be46f37b21ca1efe6aa6939661dfa8a9a0b05dac2f573e189e36e956003b5dd8 [2024-11-18 10:59:27,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:59:28,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:59:28,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:59:28,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:59:28,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:59:28,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label58.c [2024-11-18 10:59:29,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:59:29,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:59:29,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label58.c [2024-11-18 10:59:29,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64328fdd/6dd66776a0094d5b9e20841657a521f0/FLAGb1a253790 [2024-11-18 10:59:29,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c64328fdd/6dd66776a0094d5b9e20841657a521f0 [2024-11-18 10:59:29,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:59:29,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:59:29,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:59:29,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:59:29,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:59:29,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:29" (1/1) ... [2024-11-18 10:59:29,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac2dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:29, skipping insertion in model container [2024-11-18 10:59:29,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:29" (1/1) ... [2024-11-18 10:59:29,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:59:30,232 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/Problem18_label58.c[4356,4369] [2024-11-18 10:59:30,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:59:30,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:59:30,815 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/Problem18_label58.c[4356,4369] [2024-11-18 10:59:31,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:59:31,099 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:59:31,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31 WrapperNode [2024-11-18 10:59:31,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:59:31,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:59:31,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:59:31,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:59:31,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,412 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-11-18 10:59:31,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:59:31,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:59:31,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:59:31,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:59:31,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,531 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-18 10:59:31,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:59:31,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:59:31,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:59:31,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:59:31,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (1/1) ... [2024-11-18 10:59:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:59:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:59:31,742 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-18 10:59:31,745 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-18 10:59:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:59:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:59:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:59:31,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:59:31,869 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:59:31,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:59:35,407 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-11-18 10:59:35,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:59:35,442 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:59:35,443 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:59:35,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:35 BoogieIcfgContainer [2024-11-18 10:59:35,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:59:35,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:59:35,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:59:35,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:59:35,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:59:29" (1/3) ... [2024-11-18 10:59:35,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6949b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:59:35, skipping insertion in model container [2024-11-18 10:59:35,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:31" (2/3) ... [2024-11-18 10:59:35,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6949b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:59:35, skipping insertion in model container [2024-11-18 10:59:35,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:35" (3/3) ... [2024-11-18 10:59:35,454 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label58.c [2024-11-18 10:59:35,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:59:35,472 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:59:35,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:59:35,577 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;@5246c13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:59:35,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:59:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 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-18 10:59:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 10:59:35,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:35,598 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:59:35,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2024-11-18 10:59:35,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:35,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012181630] [2024-11-18 10:59:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:35,970 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-18 10:59:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012181630] [2024-11-18 10:59:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012181630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:59:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053344236] [2024-11-18 10:59:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:59:36,038 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 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 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-18 10:59:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:39,072 INFO L93 Difference]: Finished difference Result 2221 states and 4282 transitions. [2024-11-18 10:59:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:39,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-11-18 10:59:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:39,093 INFO L225 Difference]: With dead ends: 2221 [2024-11-18 10:59:39,093 INFO L226 Difference]: Without dead ends: 1384 [2024-11-18 10:59:39,098 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-18 10:59:39,101 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 755 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:39,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-18 10:59:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-18 10:59:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-11-18 10:59:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 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-18 10:59:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions. [2024-11-18 10:59:39,226 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 40 [2024-11-18 10:59:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:39,226 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions. [2024-11-18 10:59:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-18 10:59:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions. [2024-11-18 10:59:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 10:59:39,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:39,230 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, 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] [2024-11-18 10:59:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:59:39,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1315754014, now seen corresponding path program 1 times [2024-11-18 10:59:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133392479] [2024-11-18 10:59:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:59:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133392479] [2024-11-18 10:59:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133392479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:59:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884448697] [2024-11-18 10:59:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:59:39,474 INFO L87 Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-18 10:59:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:42,264 INFO L93 Difference]: Finished difference Result 4146 states and 6631 transitions. [2024-11-18 10:59:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:42,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-11-18 10:59:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:42,275 INFO L225 Difference]: With dead ends: 4146 [2024-11-18 10:59:42,275 INFO L226 Difference]: Without dead ends: 2764 [2024-11-18 10:59:42,279 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-18 10:59:42,280 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:42,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 10:59:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2024-11-18 10:59:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2024-11-18 10:59:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 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-18 10:59:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions. [2024-11-18 10:59:42,329 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 105 [2024-11-18 10:59:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions. [2024-11-18 10:59:42,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-18 10:59:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions. [2024-11-18 10:59:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-18 10:59:42,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:42,342 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:59:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:59:42,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:42,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2062257275, now seen corresponding path program 1 times [2024-11-18 10:59:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:42,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857663533] [2024-11-18 10:59:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-18 10:59:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857663533] [2024-11-18 10:59:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857663533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:43,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:43,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:59:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495590686] [2024-11-18 10:59:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:43,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:59:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:59:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:59:43,036 INFO L87 Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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-18 10:59:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:46,571 INFO L93 Difference]: Finished difference Result 7596 states and 9794 transitions. [2024-11-18 10:59:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:59:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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 223 [2024-11-18 10:59:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:46,587 INFO L225 Difference]: With dead ends: 7596 [2024-11-18 10:59:46,587 INFO L226 Difference]: Without dead ends: 4834 [2024-11-18 10:59:46,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:59:46,592 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:46,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-18 10:59:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2024-11-18 10:59:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2024-11-18 10:59:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 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-18 10:59:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions. [2024-11-18 10:59:46,668 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 223 [2024-11-18 10:59:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions. [2024-11-18 10:59:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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-18 10:59:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions. [2024-11-18 10:59:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-18 10:59:46,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:46,680 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:59:46,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:59:46,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 944089240, now seen corresponding path program 1 times [2024-11-18 10:59:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:46,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109016773] [2024-11-18 10:59:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:59:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109016773] [2024-11-18 10:59:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109016773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:47,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:59:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669513458] [2024-11-18 10:59:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:47,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:59:47,042 INFO L87 Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-18 10:59:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:49,338 INFO L93 Difference]: Finished difference Result 12426 states and 15778 transitions. [2024-11-18 10:59:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 339 [2024-11-18 10:59:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:49,369 INFO L225 Difference]: With dead ends: 12426 [2024-11-18 10:59:49,369 INFO L226 Difference]: Without dead ends: 8284 [2024-11-18 10:59:49,379 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-18 10:59:49,381 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 683 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:49,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 148 Invalid, 2982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 10:59:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2024-11-18 10:59:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 7594. [2024-11-18 10:59:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7594 states, 7593 states have (on average 1.2641907019623337) internal successors, (9599), 7593 states have internal predecessors, (9599), 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-18 10:59:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7594 states to 7594 states and 9599 transitions. [2024-11-18 10:59:49,652 INFO L78 Accepts]: Start accepts. Automaton has 7594 states and 9599 transitions. Word has length 339 [2024-11-18 10:59:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 7594 states and 9599 transitions. [2024-11-18 10:59:49,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-18 10:59:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7594 states and 9599 transitions. [2024-11-18 10:59:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-18 10:59:49,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:49,665 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:59:49,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:59:49,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1507224074, now seen corresponding path program 1 times [2024-11-18 10:59:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013973965] [2024-11-18 10:59:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 10:59:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013973965] [2024-11-18 10:59:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013973965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:59:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891765641] [2024-11-18 10:59:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:59:50,094 INFO L87 Difference]: Start difference. First operand 7594 states and 9599 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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-18 10:59:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:52,606 INFO L93 Difference]: Finished difference Result 20706 states and 26458 transitions. [2024-11-18 10:59:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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 424 [2024-11-18 10:59:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:52,652 INFO L225 Difference]: With dead ends: 20706 [2024-11-18 10:59:52,652 INFO L226 Difference]: Without dead ends: 13114 [2024-11-18 10:59:52,665 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-18 10:59:52,666 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 497 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 1073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1073 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:52,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 116 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1073 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 10:59:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2024-11-18 10:59:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 12424. [2024-11-18 10:59:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12424 states, 12423 states have (on average 1.2751348305562265) internal successors, (15841), 12423 states have internal predecessors, (15841), 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-18 10:59:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 15841 transitions. [2024-11-18 10:59:52,877 INFO L78 Accepts]: Start accepts. Automaton has 12424 states and 15841 transitions. Word has length 424 [2024-11-18 10:59:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:52,878 INFO L471 AbstractCegarLoop]: Abstraction has 12424 states and 15841 transitions. [2024-11-18 10:59:52,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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-18 10:59:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12424 states and 15841 transitions. [2024-11-18 10:59:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-11-18 10:59:52,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:52,890 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:59:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:59:52,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -814464337, now seen corresponding path program 1 times [2024-11-18 10:59:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845601534] [2024-11-18 10:59:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-18 10:59:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845601534] [2024-11-18 10:59:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845601534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:59:53,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:59:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975046139] [2024-11-18 10:59:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:59:53,282 INFO L87 Difference]: Start difference. First operand 12424 states and 15841 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-18 10:59:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:55,615 INFO L93 Difference]: Finished difference Result 24846 states and 31680 transitions. [2024-11-18 10:59:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 425 [2024-11-18 10:59:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:55,645 INFO L225 Difference]: With dead ends: 24846 [2024-11-18 10:59:55,646 INFO L226 Difference]: Without dead ends: 12424 [2024-11-18 10:59:55,662 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-18 10:59:55,663 INFO L432 NwaCegarLoop]: 1227 mSDtfsCounter, 656 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:55,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1234 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 10:59:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12424 states. [2024-11-18 10:59:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12424 to 12424. [2024-11-18 10:59:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12424 states, 12423 states have (on average 1.167753360701924) internal successors, (14507), 12423 states have internal predecessors, (14507), 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-18 10:59:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 14507 transitions. [2024-11-18 10:59:55,905 INFO L78 Accepts]: Start accepts. Automaton has 12424 states and 14507 transitions. Word has length 425 [2024-11-18 10:59:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 12424 states and 14507 transitions. [2024-11-18 10:59:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-18 10:59:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 12424 states and 14507 transitions. [2024-11-18 10:59:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-18 10:59:55,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:55,919 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 10:59:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:59:55,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:59:55,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:59:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -851617661, now seen corresponding path program 1 times [2024-11-18 10:59:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:59:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375602251] [2024-11-18 10:59:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:59:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-18 10:59:56,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:59:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375602251] [2024-11-18 10:59:56,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375602251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:59:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187643331] [2024-11-18 10:59:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:59:56,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:59:56,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:59:56,389 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-18 10:59:56,391 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-18 10:59:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:59:56,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:59:56,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:59:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-18 10:59:57,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:59:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187643331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:59:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:59:57,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-18 10:59:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571120224] [2024-11-18 10:59:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:59:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:59:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:59:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:59:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:59:57,282 INFO L87 Difference]: Start difference. First operand 12424 states and 14507 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 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-18 10:59:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:59:59,529 INFO L93 Difference]: Finished difference Result 31746 states and 37588 transitions. [2024-11-18 10:59:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:59:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 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 478 [2024-11-18 10:59:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:59:59,568 INFO L225 Difference]: With dead ends: 31746 [2024-11-18 10:59:59,568 INFO L226 Difference]: Without dead ends: 19324 [2024-11-18 10:59:59,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:59:59,587 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 400 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:59:59,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 496 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-18 10:59:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2024-11-18 10:59:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 17254. [2024-11-18 10:59:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17254 states, 17253 states have (on average 1.1538283197125139) internal successors, (19907), 17253 states have internal predecessors, (19907), 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-18 10:59:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 19907 transitions. [2024-11-18 10:59:59,896 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 19907 transitions. Word has length 478 [2024-11-18 10:59:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:59:59,897 INFO L471 AbstractCegarLoop]: Abstraction has 17254 states and 19907 transitions. [2024-11-18 10:59:59,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 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-18 10:59:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 19907 transitions. [2024-11-18 10:59:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-18 10:59:59,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:59:59,905 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, 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, 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] [2024-11-18 10:59:59,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 11:00:00,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 11:00:00,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1295000919, now seen corresponding path program 1 times [2024-11-18 11:00:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71927379] [2024-11-18 11:00:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-18 11:00:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71927379] [2024-11-18 11:00:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71927379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:00,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468808063] [2024-11-18 11:00:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:00,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:00:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:00:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:00:00,520 INFO L87 Difference]: Start difference. First operand 17254 states and 19907 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 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-18 11:00:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:02,689 INFO L93 Difference]: Finished difference Result 35939 states and 41275 transitions. [2024-11-18 11:00:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:00:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 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 479 [2024-11-18 11:00:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:02,720 INFO L225 Difference]: With dead ends: 35939 [2024-11-18 11:00:02,720 INFO L226 Difference]: Without dead ends: 18634 [2024-11-18 11:00:02,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 11:00:02,737 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:02,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-18 11:00:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2024-11-18 11:00:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 18634. [2024-11-18 11:00:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18634 states, 18633 states have (on average 1.1132399506252348) internal successors, (20743), 18633 states have internal predecessors, (20743), 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-18 11:00:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 20743 transitions. [2024-11-18 11:00:02,953 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 20743 transitions. Word has length 479 [2024-11-18 11:00:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:02,953 INFO L471 AbstractCegarLoop]: Abstraction has 18634 states and 20743 transitions. [2024-11-18 11:00:02,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 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-18 11:00:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 20743 transitions. [2024-11-18 11:00:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-11-18 11:00:02,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:02,959 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:00:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 11:00:02,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1593379923, now seen corresponding path program 1 times [2024-11-18 11:00:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128161908] [2024-11-18 11:00:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-18 11:00:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128161908] [2024-11-18 11:00:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128161908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460862875] [2024-11-18 11:00:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:03,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:03,717 INFO L87 Difference]: Start difference. First operand 18634 states and 20743 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-18 11:00:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:05,421 INFO L93 Difference]: Finished difference Result 37266 states and 41484 transitions. [2024-11-18 11:00:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:05,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 510 [2024-11-18 11:00:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:05,439 INFO L225 Difference]: With dead ends: 37266 [2024-11-18 11:00:05,439 INFO L226 Difference]: Without dead ends: 18634 [2024-11-18 11:00:05,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 11:00:05,451 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 757 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:05,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 11:00:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18634 states. [2024-11-18 11:00:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18634 to 17944. [2024-11-18 11:00:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17944 states, 17943 states have (on average 1.0965836259265451) internal successors, (19676), 17943 states have internal predecessors, (19676), 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-18 11:00:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17944 states to 17944 states and 19676 transitions. [2024-11-18 11:00:05,736 INFO L78 Accepts]: Start accepts. Automaton has 17944 states and 19676 transitions. Word has length 510 [2024-11-18 11:00:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:05,739 INFO L471 AbstractCegarLoop]: Abstraction has 17944 states and 19676 transitions. [2024-11-18 11:00:05,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-18 11:00:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 17944 states and 19676 transitions. [2024-11-18 11:00:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-11-18 11:00:05,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:05,747 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 11:00:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 11:00:05,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:05,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2144438747, now seen corresponding path program 1 times [2024-11-18 11:00:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:05,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675631145] [2024-11-18 11:00:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-18 11:00:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675631145] [2024-11-18 11:00:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675631145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835928161] [2024-11-18 11:00:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:06,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:06,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:06,353 INFO L87 Difference]: Start difference. First operand 17944 states and 19676 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-18 11:00:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:08,175 INFO L93 Difference]: Finished difference Result 43476 states and 47670 transitions. [2024-11-18 11:00:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 541 [2024-11-18 11:00:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:08,211 INFO L225 Difference]: With dead ends: 43476 [2024-11-18 11:00:08,211 INFO L226 Difference]: Without dead ends: 25534 [2024-11-18 11:00:08,229 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-18 11:00:08,230 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 979 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 11:00:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25534 states. [2024-11-18 11:00:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25534 to 25534. [2024-11-18 11:00:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.0807973994438569) internal successors, (27596), 25533 states have internal predecessors, (27596), 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-18 11:00:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 27596 transitions. [2024-11-18 11:00:08,518 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 27596 transitions. Word has length 541 [2024-11-18 11:00:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:08,518 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 27596 transitions. [2024-11-18 11:00:08,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-18 11:00:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 27596 transitions. [2024-11-18 11:00:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-11-18 11:00:08,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:08,528 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:00:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 11:00:08,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1735991247, now seen corresponding path program 1 times [2024-11-18 11:00:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714037620] [2024-11-18 11:00:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 319 proven. 252 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-18 11:00:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714037620] [2024-11-18 11:00:09,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714037620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 11:00:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591427753] [2024-11-18 11:00:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 11:00:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:00:09,363 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-18 11:00:09,364 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-18 11:00:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:09,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 11:00:09,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:00:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-18 11:00:09,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:00:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591427753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 11:00:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-18 11:00:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734009781] [2024-11-18 11:00:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 11:00:09,683 INFO L87 Difference]: Start difference. First operand 25534 states and 27596 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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-18 11:00:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:11,537 INFO L93 Difference]: Finished difference Result 57966 states and 63542 transitions. [2024-11-18 11:00:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 594 [2024-11-18 11:00:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:11,576 INFO L225 Difference]: With dead ends: 57966 [2024-11-18 11:00:11,576 INFO L226 Difference]: Without dead ends: 32434 [2024-11-18 11:00:11,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 11:00:11,596 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 699 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:11,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 165 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-18 11:00:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32434 states. [2024-11-18 11:00:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32434 to 32434. [2024-11-18 11:00:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32434 states, 32433 states have (on average 1.087503468689298) internal successors, (35271), 32433 states have internal predecessors, (35271), 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-18 11:00:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32434 states to 32434 states and 35271 transitions. [2024-11-18 11:00:11,927 INFO L78 Accepts]: Start accepts. Automaton has 32434 states and 35271 transitions. Word has length 594 [2024-11-18 11:00:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:11,928 INFO L471 AbstractCegarLoop]: Abstraction has 32434 states and 35271 transitions. [2024-11-18 11:00:11,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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-18 11:00:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32434 states and 35271 transitions. [2024-11-18 11:00:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2024-11-18 11:00:11,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:11,937 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:00:11,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 11:00:12,140 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,SelfDestructingSolverStorable10 [2024-11-18 11:00:12,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:12,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1404896480, now seen corresponding path program 1 times [2024-11-18 11:00:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812738603] [2024-11-18 11:00:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-18 11:00:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812738603] [2024-11-18 11:00:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812738603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867085555] [2024-11-18 11:00:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:12,582 INFO L87 Difference]: Start difference. First operand 32434 states and 35271 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-18 11:00:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:14,563 INFO L93 Difference]: Finished difference Result 74526 states and 81930 transitions. [2024-11-18 11:00:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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 600 [2024-11-18 11:00:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:14,604 INFO L225 Difference]: With dead ends: 74526 [2024-11-18 11:00:14,604 INFO L226 Difference]: Without dead ends: 39334 [2024-11-18 11:00:14,631 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-18 11:00:14,631 INFO L432 NwaCegarLoop]: 1114 mSDtfsCounter, 603 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:14,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1121 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-18 11:00:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2024-11-18 11:00:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 39334. [2024-11-18 11:00:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39334 states, 39333 states have (on average 1.079348130068899) internal successors, (42454), 39333 states have internal predecessors, (42454), 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-18 11:00:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39334 states to 39334 states and 42454 transitions. [2024-11-18 11:00:14,953 INFO L78 Accepts]: Start accepts. Automaton has 39334 states and 42454 transitions. Word has length 600 [2024-11-18 11:00:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:14,954 INFO L471 AbstractCegarLoop]: Abstraction has 39334 states and 42454 transitions. [2024-11-18 11:00:14,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-18 11:00:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39334 states and 42454 transitions. [2024-11-18 11:00:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-11-18 11:00:14,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:14,962 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 11:00:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 11:00:14,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1211479513, now seen corresponding path program 1 times [2024-11-18 11:00:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282454069] [2024-11-18 11:00:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-18 11:00:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282454069] [2024-11-18 11:00:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282454069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031195503] [2024-11-18 11:00:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:15,315 INFO L87 Difference]: Start difference. First operand 39334 states and 42454 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-18 11:00:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:17,166 INFO L93 Difference]: Finished difference Result 88326 states and 96242 transitions. [2024-11-18 11:00:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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 618 [2024-11-18 11:00:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:17,217 INFO L225 Difference]: With dead ends: 88326 [2024-11-18 11:00:17,218 INFO L226 Difference]: Without dead ends: 45544 [2024-11-18 11:00:17,247 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-18 11:00:17,247 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 650 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:17,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1060 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 11:00:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45544 states. [2024-11-18 11:00:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45544 to 43474. [2024-11-18 11:00:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43474 states, 43473 states have (on average 1.0467646585236814) internal successors, (45506), 43473 states have internal predecessors, (45506), 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-18 11:00:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43474 states to 43474 states and 45506 transitions. [2024-11-18 11:00:17,784 INFO L78 Accepts]: Start accepts. Automaton has 43474 states and 45506 transitions. Word has length 618 [2024-11-18 11:00:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 43474 states and 45506 transitions. [2024-11-18 11:00:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-18 11:00:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43474 states and 45506 transitions. [2024-11-18 11:00:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2024-11-18 11:00:17,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:17,803 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 11:00:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 11:00:17,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1291306902, now seen corresponding path program 1 times [2024-11-18 11:00:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379193780] [2024-11-18 11:00:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-18 11:00:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:18,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379193780] [2024-11-18 11:00:18,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379193780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:18,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:18,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686412921] [2024-11-18 11:00:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:18,189 INFO L87 Difference]: Start difference. First operand 43474 states and 45506 transitions. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-18 11:00:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:20,027 INFO L93 Difference]: Finished difference Result 96606 states and 101398 transitions. [2024-11-18 11:00:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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 833 [2024-11-18 11:00:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:20,082 INFO L225 Difference]: With dead ends: 96606 [2024-11-18 11:00:20,083 INFO L226 Difference]: Without dead ends: 53134 [2024-11-18 11:00:20,107 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-18 11:00:20,108 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 456 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:20,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 962 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 11:00:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2024-11-18 11:00:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 53134. [2024-11-18 11:00:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.0428170816629967) internal successors, (55408), 53133 states have internal predecessors, (55408), 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-18 11:00:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 55408 transitions. [2024-11-18 11:00:20,566 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 55408 transitions. Word has length 833 [2024-11-18 11:00:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 55408 transitions. [2024-11-18 11:00:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-18 11:00:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 55408 transitions. [2024-11-18 11:00:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-11-18 11:00:20,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:20,580 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 11:00:20,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 11:00:20,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:20,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -85454304, now seen corresponding path program 1 times [2024-11-18 11:00:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:20,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942692184] [2024-11-18 11:00:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:20,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 907 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-11-18 11:00:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942692184] [2024-11-18 11:00:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942692184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:21,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:21,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119080047] [2024-11-18 11:00:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:00:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:00:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:00:21,666 INFO L87 Difference]: Start difference. First operand 53134 states and 55408 transitions. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 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-18 11:00:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:24,231 INFO L93 Difference]: Finished difference Result 113166 states and 118251 transitions. [2024-11-18 11:00:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:00:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 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 862 [2024-11-18 11:00:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:24,291 INFO L225 Difference]: With dead ends: 113166 [2024-11-18 11:00:24,291 INFO L226 Difference]: Without dead ends: 60034 [2024-11-18 11:00:24,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 11:00:24,326 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1407 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:24,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 69 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 11:00:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60034 states. [2024-11-18 11:00:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60034 to 59344. [2024-11-18 11:00:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59344 states, 59343 states have (on average 1.0417403906105185) internal successors, (61820), 59343 states have internal predecessors, (61820), 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-18 11:00:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59344 states to 59344 states and 61820 transitions. [2024-11-18 11:00:25,124 INFO L78 Accepts]: Start accepts. Automaton has 59344 states and 61820 transitions. Word has length 862 [2024-11-18 11:00:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:25,125 INFO L471 AbstractCegarLoop]: Abstraction has 59344 states and 61820 transitions. [2024-11-18 11:00:25,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 3 states have internal predecessors, (610), 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-18 11:00:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 59344 states and 61820 transitions. [2024-11-18 11:00:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1457 [2024-11-18 11:00:25,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:25,153 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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-18 11:00:25,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 11:00:25,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 692107644, now seen corresponding path program 1 times [2024-11-18 11:00:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946144963] [2024-11-18 11:00:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2024-11-18 11:00:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946144963] [2024-11-18 11:00:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946144963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:27,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759214072] [2024-11-18 11:00:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:27,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:27,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:27,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:27,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:27,343 INFO L87 Difference]: Start difference. First operand 59344 states and 61820 transitions. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-18 11:00:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:29,041 INFO L93 Difference]: Finished difference Result 120066 states and 125045 transitions. [2024-11-18 11:00:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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 1456 [2024-11-18 11:00:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:29,107 INFO L225 Difference]: With dead ends: 120066 [2024-11-18 11:00:29,107 INFO L226 Difference]: Without dead ends: 60724 [2024-11-18 11:00:29,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-18 11:00:29,123 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:29,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 760 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 11:00:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60724 states. [2024-11-18 11:00:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 60724. [2024-11-18 11:00:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60724 states, 60723 states have (on average 1.0371193781598407) internal successors, (62977), 60723 states have internal predecessors, (62977), 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-18 11:00:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60724 states to 60724 states and 62977 transitions. [2024-11-18 11:00:29,881 INFO L78 Accepts]: Start accepts. Automaton has 60724 states and 62977 transitions. Word has length 1456 [2024-11-18 11:00:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:29,882 INFO L471 AbstractCegarLoop]: Abstraction has 60724 states and 62977 transitions. [2024-11-18 11:00:29,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-18 11:00:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 60724 states and 62977 transitions. [2024-11-18 11:00:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1511 [2024-11-18 11:00:29,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:00:29,908 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-18 11:00:29,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 11:00:29,909 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:00:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:00:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2127013482, now seen corresponding path program 1 times [2024-11-18 11:00:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:00:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541717982] [2024-11-18 11:00:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:00:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:00:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:00:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3189 backedges. 1660 proven. 0 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2024-11-18 11:00:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:00:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541717982] [2024-11-18 11:00:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541717982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:00:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:00:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:00:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156256534] [2024-11-18 11:00:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:00:31,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:00:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:00:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:00:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:00:31,044 INFO L87 Difference]: Start difference. First operand 60724 states and 62977 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-18 11:00:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:00:32,815 INFO L93 Difference]: Finished difference Result 121444 states and 125976 transitions. [2024-11-18 11:00:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:00:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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 1510 [2024-11-18 11:00:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:00:32,817 INFO L225 Difference]: With dead ends: 121444 [2024-11-18 11:00:32,817 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 11:00:32,853 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-18 11:00:32,853 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-18 11:00:32,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 945 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-18 11:00:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 11:00:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 11:00:32,854 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-18 11:00:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 11:00:32,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1510 [2024-11-18 11:00:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:00:32,855 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 11:00:32,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-18 11:00:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 11:00:32,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 11:00:32,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:00:32,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 11:00:32,859 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:00:32,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 11:00:34,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:00:34,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:00:34 BoogieIcfgContainer [2024-11-18 11:00:34,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:00:34,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:00:34,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:00:34,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:00:34,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:35" (3/4) ... [2024-11-18 11:00:34,249 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 11:00:34,302 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-18 11:00:34,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 11:00:34,312 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 11:00:34,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 11:00:34,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 11:00:34,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 11:00:34,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:00:34,629 INFO L158 Benchmark]: Toolchain (without parser) took 64803.35ms. Allocated memory was 151.0MB in the beginning and 5.9GB in the end (delta: 5.7GB). Free memory was 67.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 940.3MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,629 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:00:34,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1272.40ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 67.1MB in the beginning and 76.9MB in the end (delta: -9.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 311.65ms. Allocated memory is still 220.2MB. Free memory was 76.9MB in the beginning and 146.7MB in the end (delta: -69.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,630 INFO L158 Benchmark]: Boogie Preprocessor took 285.98ms. Allocated memory is still 220.2MB. Free memory was 146.7MB in the beginning and 90.0MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,631 INFO L158 Benchmark]: RCFGBuilder took 3742.73ms. Allocated memory was 220.2MB in the beginning and 369.1MB in the end (delta: 148.9MB). Free memory was 90.0MB in the beginning and 143.9MB in the end (delta: -53.8MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,631 INFO L158 Benchmark]: TraceAbstraction took 58799.60ms. Allocated memory was 369.1MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 143.9MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 882.1MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,631 INFO L158 Benchmark]: Witness Printer took 382.64ms. Allocated memory is still 5.9GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-18 11:00:34,635 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.21ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1272.40ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 67.1MB in the beginning and 76.9MB in the end (delta: -9.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 311.65ms. Allocated memory is still 220.2MB. Free memory was 76.9MB in the beginning and 146.7MB in the end (delta: -69.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 285.98ms. Allocated memory is still 220.2MB. Free memory was 146.7MB in the beginning and 90.0MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3742.73ms. Allocated memory was 220.2MB in the beginning and 369.1MB in the end (delta: 148.9MB). Free memory was 90.0MB in the beginning and 143.9MB in the end (delta: -53.8MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58799.60ms. Allocated memory was 369.1MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 143.9MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 882.1MB. Max. memory is 16.1GB. * Witness Printer took 382.64ms. Allocated memory is still 5.9GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. 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: 139]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.3s, OverallIterations: 17, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12524 SdHoareTripleChecker+Valid, 35.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12524 mSDsluCounter, 11129 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 8025 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36208 IncrementalHoareTripleChecker+Invalid, 44233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8025 mSolverCounterUnsat, 11000 mSDtfsCounter, 36208 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1131 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60724occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 7590 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 11109 NumberOfCodeBlocks, 11109 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 11090 ConstructedInterpolants, 0 QuantifiedInterpolants, 23517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 13049/13379 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: 4269]: Loop Invariant Derived loop invariant: (((((((((((((((a15 <= 4) && (a24 <= 3)) && (a24 != 3)) && (a3 <= 99)) || ((a18 == 11) && (a24 <= 3))) || ((a24 == 0) && (a15 <= 4))) || ((((a18 == 12) && (a24 == 4)) && (a15 <= 5)) && (a3 <= 99))) || ((a24 == 3) && (a18 == 12))) || ((a24 == 0) && (a3 <= 99))) || ((a18 <= 10) && (a24 <= 3))) || (((a15 != 4) && (a24 <= 3)) && (a18 == 12))) || (((a18 == 11) && (a24 == 4)) && (a15 <= 5))) || (((a15 <= 4) && (a18 == 12)) && (a24 == 4))) || (((a18 <= 10) && (a24 == 4)) && (a15 <= 5))) || ((a24 == 1) && (a15 <= 4))) RESULT: Ultimate proved your program to be correct! [2024-11-18 11:00:34,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE