./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.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 63eefb43987dda8e1668da6021cabb64b22b4f62f3f84321ab9d4efedc35c362 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:44:36,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:44:36,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:44:36,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:44:36,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:44:36,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:44:36,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:44:36,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:44:36,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:44:36,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:44:36,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:44:36,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:44:36,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:44:36,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:44:36,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:44:36,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:44:36,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:44:36,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:44:36,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:44:36,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:44:36,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:44:36,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:44:36,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:44:36,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:44:36,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:44:36,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:44:36,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:44:36,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:44:36,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:44:36,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:44:36,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:44:36,687 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 -> 63eefb43987dda8e1668da6021cabb64b22b4f62f3f84321ab9d4efedc35c362 [2024-10-13 23:44:36,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:44:36,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:44:36,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:44:36,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:44:36,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:44:36,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c [2024-10-13 23:44:38,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:44:38,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:44:38,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c [2024-10-13 23:44:38,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0b4af6c/2cdd6acd74254c0c8d4ca84cd2fdc516/FLAG5748085f2 [2024-10-13 23:44:38,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0b4af6c/2cdd6acd74254c0c8d4ca84cd2fdc516 [2024-10-13 23:44:38,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:44:38,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:44:38,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:44:38,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:44:38,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:44:38,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:38" (1/1) ... [2024-10-13 23:44:38,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e1b9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:38, skipping insertion in model container [2024-10-13 23:44:38,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:38" (1/1) ... [2024-10-13 23:44:38,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:44:38,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c[7777,7790] [2024-10-13 23:44:39,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:44:39,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:44:39,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c[7777,7790] [2024-10-13 23:44:39,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:44:39,351 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:44:39,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39 WrapperNode [2024-10-13 23:44:39,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:44:39,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:44:39,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:44:39,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:44:39,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,546 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-13 23:44:39,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:44:39,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:44:39,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:44:39,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:44:39,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,710 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-10-13 23:44:39,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:44:39,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:44:39,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:44:39,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:44:39,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (1/1) ... [2024-10-13 23:44:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:44:39,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:44:39,897 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-10-13 23:44:39,910 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-10-13 23:44:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:44:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:44:39,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:44:39,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:44:40,000 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:44:40,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:44:41,813 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-13 23:44:41,813 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:44:41,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:44:41,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:44:41,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:41 BoogieIcfgContainer [2024-10-13 23:44:41,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:44:41,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:44:41,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:44:41,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:44:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:44:38" (1/3) ... [2024-10-13 23:44:41,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ca8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:41, skipping insertion in model container [2024-10-13 23:44:41,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:39" (2/3) ... [2024-10-13 23:44:41,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ca8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:41, skipping insertion in model container [2024-10-13 23:44:41,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:41" (3/3) ... [2024-10-13 23:44:41,876 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label05.c [2024-10-13 23:44:41,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:44:41,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:44:41,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:44:41,959 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;@dda56ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:44:41,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:44:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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-10-13 23:44:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 23:44:41,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:41,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:41,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 606458781, now seen corresponding path program 1 times [2024-10-13 23:44:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188423334] [2024-10-13 23:44:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:44:42,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188423334] [2024-10-13 23:44:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188423334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:42,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417794428] [2024-10-13 23:44:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:42,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:44:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:44:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:44:42,229 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-10-13 23:44:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:42,266 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-13 23:44:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:44:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2024-10-13 23:44:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:42,281 INFO L225 Difference]: With dead ends: 723 [2024-10-13 23:44:42,285 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 23:44:42,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:44:42,294 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:42,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:44:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 23:44:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-13 23:44:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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-10-13 23:44:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-13 23:44:42,420 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 63 [2024-10-13 23:44:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-13 23:44:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-10-13 23:44:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-13 23:44:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 23:44:42,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:42,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:42,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:44:42,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:42,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash 153415768, now seen corresponding path program 1 times [2024-10-13 23:44:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:42,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766763312] [2024-10-13 23:44:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:44:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766763312] [2024-10-13 23:44:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766763312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440481148] [2024-10-13 23:44:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:42,625 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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-10-13 23:44:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:43,939 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-13 23:44:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2024-10-13 23:44:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:43,943 INFO L225 Difference]: With dead ends: 1025 [2024-10-13 23:44:43,943 INFO L226 Difference]: Without dead ends: 666 [2024-10-13 23:44:43,944 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-10-13 23:44:43,944 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 264 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:43,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:44:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-13 23:44:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-13 23:44:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 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-10-13 23:44:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-13 23:44:43,972 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 63 [2024-10-13 23:44:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-13 23:44:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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-10-13 23:44:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-13 23:44:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 23:44:43,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:43,975 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, 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] [2024-10-13 23:44:43,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:44:43,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1956415015, now seen corresponding path program 1 times [2024-10-13 23:44:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054386675] [2024-10-13 23:44:43,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:44:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054386675] [2024-10-13 23:44:44,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054386675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:44,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765250725] [2024-10-13 23:44:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:44,138 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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-10-13 23:44:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:45,690 INFO L93 Difference]: Finished difference Result 1952 states and 2892 transitions. [2024-10-13 23:44:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:45,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 138 [2024-10-13 23:44:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:45,694 INFO L225 Difference]: With dead ends: 1952 [2024-10-13 23:44:45,694 INFO L226 Difference]: Without dead ends: 1289 [2024-10-13 23:44:45,696 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-10-13 23:44:45,696 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:45,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:44:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-13 23:44:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1281. [2024-10-13 23:44:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3984375) internal successors, (1790), 1280 states have internal predecessors, (1790), 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-10-13 23:44:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1790 transitions. [2024-10-13 23:44:45,713 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1790 transitions. Word has length 138 [2024-10-13 23:44:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:45,714 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1790 transitions. [2024-10-13 23:44:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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-10-13 23:44:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1790 transitions. [2024-10-13 23:44:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 23:44:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:45,716 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, 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] [2024-10-13 23:44:45,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:44:45,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:45,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash -525964323, now seen corresponding path program 1 times [2024-10-13 23:44:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962766739] [2024-10-13 23:44:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:44:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962766739] [2024-10-13 23:44:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962766739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:45,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155809450] [2024-10-13 23:44:45,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:45,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:45,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:45,821 INFO L87 Difference]: Start difference. First operand 1281 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-10-13 23:44:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:47,140 INFO L93 Difference]: Finished difference Result 3763 states and 5259 transitions. [2024-10-13 23:44:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 142 [2024-10-13 23:44:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:47,147 INFO L225 Difference]: With dead ends: 3763 [2024-10-13 23:44:47,147 INFO L226 Difference]: Without dead ends: 2483 [2024-10-13 23:44:47,148 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-10-13 23:44:47,149 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:47,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:44:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-13 23:44:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-13 23:44:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.2811926605504587) internal successors, (2793), 2180 states have internal predecessors, (2793), 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-10-13 23:44:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2793 transitions. [2024-10-13 23:44:47,175 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2793 transitions. Word has length 142 [2024-10-13 23:44:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2793 transitions. [2024-10-13 23:44:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-10-13 23:44:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2793 transitions. [2024-10-13 23:44:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 23:44:47,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:47,184 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:47,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:44:47,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 478620349, now seen corresponding path program 1 times [2024-10-13 23:44:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190679415] [2024-10-13 23:44:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-13 23:44:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190679415] [2024-10-13 23:44:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190679415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:47,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174781631] [2024-10-13 23:44:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:47,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:47,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:47,416 INFO L87 Difference]: Start difference. First operand 2181 states and 2793 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-10-13 23:44:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:48,901 INFO L93 Difference]: Finished difference Result 6165 states and 7957 transitions. [2024-10-13 23:44:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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 233 [2024-10-13 23:44:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:48,912 INFO L225 Difference]: With dead ends: 6165 [2024-10-13 23:44:48,912 INFO L226 Difference]: Without dead ends: 3985 [2024-10-13 23:44:48,915 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-10-13 23:44:48,918 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:48,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:44:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-13 23:44:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-13 23:44:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2195652173913043) internal successors, (4488), 3680 states have internal predecessors, (4488), 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-10-13 23:44:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4488 transitions. [2024-10-13 23:44:48,974 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4488 transitions. Word has length 233 [2024-10-13 23:44:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4488 transitions. [2024-10-13 23:44:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-10-13 23:44:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4488 transitions. [2024-10-13 23:44:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-13 23:44:48,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:48,980 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:48,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:44:48,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:48,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1333316291, now seen corresponding path program 1 times [2024-10-13 23:44:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225951720] [2024-10-13 23:44:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 23:44:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225951720] [2024-10-13 23:44:49,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225951720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:49,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:49,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:44:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251775568] [2024-10-13 23:44:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:49,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:49,921 INFO L87 Difference]: Start difference. First operand 3681 states and 4488 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-10-13 23:44:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:51,567 INFO L93 Difference]: Finished difference Result 7660 states and 9286 transitions. [2024-10-13 23:44:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:51,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 335 [2024-10-13 23:44:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:51,577 INFO L225 Difference]: With dead ends: 7660 [2024-10-13 23:44:51,577 INFO L226 Difference]: Without dead ends: 3980 [2024-10-13 23:44:51,581 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-10-13 23:44:51,582 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:51,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:44:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-13 23:44:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-13 23:44:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.204574013571249) internal successors, (4793), 3979 states have internal predecessors, (4793), 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-10-13 23:44:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4793 transitions. [2024-10-13 23:44:51,626 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4793 transitions. Word has length 335 [2024-10-13 23:44:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4793 transitions. [2024-10-13 23:44:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-10-13 23:44:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4793 transitions. [2024-10-13 23:44:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-13 23:44:51,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:51,630 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:44:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:44:51,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:51,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1575473336, now seen corresponding path program 1 times [2024-10-13 23:44:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941900287] [2024-10-13 23:44:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:44:51,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941900287] [2024-10-13 23:44:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941900287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:51,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:51,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:44:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684915145] [2024-10-13 23:44:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:51,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:51,847 INFO L87 Difference]: Start difference. First operand 3980 states and 4793 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-10-13 23:44:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:53,192 INFO L93 Difference]: Finished difference Result 9464 states and 11667 transitions. [2024-10-13 23:44:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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 350 [2024-10-13 23:44:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:53,206 INFO L225 Difference]: With dead ends: 9464 [2024-10-13 23:44:53,206 INFO L226 Difference]: Without dead ends: 5784 [2024-10-13 23:44:53,210 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-10-13 23:44:53,211 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 252 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:53,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:44:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-13 23:44:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5782. [2024-10-13 23:44:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.1672720982528975) internal successors, (6748), 5781 states have internal predecessors, (6748), 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-10-13 23:44:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6748 transitions. [2024-10-13 23:44:53,280 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6748 transitions. Word has length 350 [2024-10-13 23:44:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:53,280 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6748 transitions. [2024-10-13 23:44:53,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-10-13 23:44:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6748 transitions. [2024-10-13 23:44:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-13 23:44:53,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:53,285 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:44:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:44:53,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 272266389, now seen corresponding path program 1 times [2024-10-13 23:44:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126199852] [2024-10-13 23:44:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:44:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126199852] [2024-10-13 23:44:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126199852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:44:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410821387] [2024-10-13 23:44:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:53,525 INFO L87 Difference]: Start difference. First operand 5782 states and 6748 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10-13 23:44:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:54,739 INFO L93 Difference]: Finished difference Result 13363 states and 15903 transitions. [2024-10-13 23:44:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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 409 [2024-10-13 23:44:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:54,758 INFO L225 Difference]: With dead ends: 13363 [2024-10-13 23:44:54,758 INFO L226 Difference]: Without dead ends: 7881 [2024-10-13 23:44:54,763 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-10-13 23:44:54,764 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 263 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:54,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:44:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-10-13 23:44:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7283. [2024-10-13 23:44:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7282 states have (on average 1.1484482285086515) internal successors, (8363), 7282 states have internal predecessors, (8363), 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-10-13 23:44:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 8363 transitions. [2024-10-13 23:44:54,933 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 8363 transitions. Word has length 409 [2024-10-13 23:44:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:54,934 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 8363 transitions. [2024-10-13 23:44:54,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-10-13 23:44:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 8363 transitions. [2024-10-13 23:44:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-13 23:44:54,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:54,946 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:44:54,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:44:54,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1367302260, now seen corresponding path program 1 times [2024-10-13 23:44:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487913049] [2024-10-13 23:44:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:44:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487913049] [2024-10-13 23:44:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487913049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:44:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837353457] [2024-10-13 23:44:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:55,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:55,392 INFO L87 Difference]: Start difference. First operand 7283 states and 8363 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-10-13 23:44:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:56,757 INFO L93 Difference]: Finished difference Result 16068 states and 18807 transitions. [2024-10-13 23:44:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:56,758 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 426 [2024-10-13 23:44:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:56,775 INFO L225 Difference]: With dead ends: 16068 [2024-10-13 23:44:56,776 INFO L226 Difference]: Without dead ends: 9085 [2024-10-13 23:44:56,780 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-10-13 23:44:56,781 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 248 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:56,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 618 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:44:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-10-13 23:44:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8779. [2024-10-13 23:44:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8779 states, 8778 states have (on average 1.1346548188653451) internal successors, (9960), 8778 states have internal predecessors, (9960), 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-10-13 23:44:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8779 states to 8779 states and 9960 transitions. [2024-10-13 23:44:56,895 INFO L78 Accepts]: Start accepts. Automaton has 8779 states and 9960 transitions. Word has length 426 [2024-10-13 23:44:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:56,897 INFO L471 AbstractCegarLoop]: Abstraction has 8779 states and 9960 transitions. [2024-10-13 23:44:56,897 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-10-13 23:44:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8779 states and 9960 transitions. [2024-10-13 23:44:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-10-13 23:44:56,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:56,901 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:44:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:44:56,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:56,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1706918564, now seen corresponding path program 1 times [2024-10-13 23:44:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:56,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862480901] [2024-10-13 23:44:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:44:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862480901] [2024-10-13 23:44:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862480901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:44:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521026656] [2024-10-13 23:44:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:57,143 INFO L87 Difference]: Start difference. First operand 8779 states and 9960 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-10-13 23:44:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:58,388 INFO L93 Difference]: Finished difference Result 20547 states and 23477 transitions. [2024-10-13 23:44:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 436 [2024-10-13 23:44:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:58,402 INFO L225 Difference]: With dead ends: 20547 [2024-10-13 23:44:58,403 INFO L226 Difference]: Without dead ends: 12068 [2024-10-13 23:44:58,408 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-10-13 23:44:58,408 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 249 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:58,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:44:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12068 states. [2024-10-13 23:44:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12068 to 7876. [2024-10-13 23:44:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1445079365079365) internal successors, (9013), 7875 states have internal predecessors, (9013), 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-10-13 23:44:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9013 transitions. [2024-10-13 23:44:58,481 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9013 transitions. Word has length 436 [2024-10-13 23:44:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:58,482 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9013 transitions. [2024-10-13 23:44:58,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-10-13 23:44:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9013 transitions. [2024-10-13 23:44:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-10-13 23:44:58,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:58,485 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, 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, 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] [2024-10-13 23:44:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:44:58,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1742212677, now seen corresponding path program 1 times [2024-10-13 23:44:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003186779] [2024-10-13 23:44:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:44:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-10-13 23:44:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:44:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003186779] [2024-10-13 23:44:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003186779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:44:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:44:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:44:58,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325465941] [2024-10-13 23:44:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:44:58,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:44:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:44:58,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:44:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:44:58,681 INFO L87 Difference]: Start difference. First operand 7876 states and 9013 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-13 23:44:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:44:59,817 INFO L93 Difference]: Finished difference Result 17843 states and 20677 transitions. [2024-10-13 23:44:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:44:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 527 [2024-10-13 23:44:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:44:59,830 INFO L225 Difference]: With dead ends: 17843 [2024-10-13 23:44:59,830 INFO L226 Difference]: Without dead ends: 10267 [2024-10-13 23:44:59,834 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-10-13 23:44:59,835 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 351 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:44:59,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:44:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2024-10-13 23:44:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 10267. [2024-10-13 23:44:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 10266 states have (on average 1.1468926553672316) internal successors, (11774), 10266 states have internal predecessors, (11774), 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-10-13 23:44:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 11774 transitions. [2024-10-13 23:44:59,918 INFO L78 Accepts]: Start accepts. Automaton has 10267 states and 11774 transitions. Word has length 527 [2024-10-13 23:44:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:44:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 10267 states and 11774 transitions. [2024-10-13 23:44:59,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-10-13 23:44:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10267 states and 11774 transitions. [2024-10-13 23:44:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-13 23:44:59,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:44:59,922 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:44:59,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:44:59,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:44:59,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:44:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1472295447, now seen corresponding path program 1 times [2024-10-13 23:44:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:44:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715939558] [2024-10-13 23:44:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:44:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:44:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 23:45:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715939558] [2024-10-13 23:45:00,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715939558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:00,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135798558] [2024-10-13 23:45:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:00,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:00,299 INFO L87 Difference]: Start difference. First operand 10267 states and 11774 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-10-13 23:45:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:01,602 INFO L93 Difference]: Finished difference Result 25032 states and 28937 transitions. [2024-10-13 23:45:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 551 [2024-10-13 23:45:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:01,620 INFO L225 Difference]: With dead ends: 25032 [2024-10-13 23:45:01,621 INFO L226 Difference]: Without dead ends: 15065 [2024-10-13 23:45:01,630 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-10-13 23:45:01,631 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:01,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:45:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15065 states. [2024-10-13 23:45:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15065 to 14456. [2024-10-13 23:45:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14456 states, 14455 states have (on average 1.1328951919750951) internal successors, (16376), 14455 states have internal predecessors, (16376), 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-10-13 23:45:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14456 states to 14456 states and 16376 transitions. [2024-10-13 23:45:01,766 INFO L78 Accepts]: Start accepts. Automaton has 14456 states and 16376 transitions. Word has length 551 [2024-10-13 23:45:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:01,767 INFO L471 AbstractCegarLoop]: Abstraction has 14456 states and 16376 transitions. [2024-10-13 23:45:01,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-10-13 23:45:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14456 states and 16376 transitions. [2024-10-13 23:45:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-10-13 23:45:01,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:01,774 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:01,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:45:01,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:01,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1257818265, now seen corresponding path program 1 times [2024-10-13 23:45:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:01,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004946938] [2024-10-13 23:45:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 620 proven. 39 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-13 23:45:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004946938] [2024-10-13 23:45:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004946938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:45:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43949168] [2024-10-13 23:45:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:02,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:45:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:45:02,422 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-10-13 23:45:02,425 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-10-13 23:45:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:02,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:45:02,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:45:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-13 23:45:03,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:45:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43949168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:03,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:45:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:45:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448412406] [2024-10-13 23:45:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:03,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:45:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:03,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:45:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:45:03,489 INFO L87 Difference]: Start difference. First operand 14456 states and 16376 transitions. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 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-10-13 23:45:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:05,590 INFO L93 Difference]: Finished difference Result 30109 states and 34083 transitions. [2024-10-13 23:45:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:45:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 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-10-13 23:45:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:05,607 INFO L225 Difference]: With dead ends: 30109 [2024-10-13 23:45:05,607 INFO L226 Difference]: Without dead ends: 15654 [2024-10-13 23:45:05,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:45:05,621 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:05,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 357 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:45:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15654 states. [2024-10-13 23:45:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15654 to 15354. [2024-10-13 23:45:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15354 states, 15353 states have (on average 1.1271412753207841) internal successors, (17305), 15353 states have internal predecessors, (17305), 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-10-13 23:45:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 17305 transitions. [2024-10-13 23:45:05,752 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 17305 transitions. Word has length 618 [2024-10-13 23:45:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:05,752 INFO L471 AbstractCegarLoop]: Abstraction has 15354 states and 17305 transitions. [2024-10-13 23:45:05,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 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-10-13 23:45:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 17305 transitions. [2024-10-13 23:45:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-10-13 23:45:05,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:05,762 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:05,778 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-10-13 23:45:05,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 23:45:05,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1500282598, now seen corresponding path program 1 times [2024-10-13 23:45:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440998596] [2024-10-13 23:45:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-13 23:45:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440998596] [2024-10-13 23:45:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440998596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:06,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775373049] [2024-10-13 23:45:06,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:06,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:06,273 INFO L87 Difference]: Start difference. First operand 15354 states and 17305 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) 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-10-13 23:45:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:07,349 INFO L93 Difference]: Finished difference Result 30705 states and 34607 transitions. [2024-10-13 23:45:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:07,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) 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 643 [2024-10-13 23:45:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:07,366 INFO L225 Difference]: With dead ends: 30705 [2024-10-13 23:45:07,367 INFO L226 Difference]: Without dead ends: 15352 [2024-10-13 23:45:07,375 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-10-13 23:45:07,376 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:07,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 69 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:45:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15352 states. [2024-10-13 23:45:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15352 to 15352. [2024-10-13 23:45:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15352 states, 15351 states have (on average 1.1270275552081297) internal successors, (17301), 15351 states have internal predecessors, (17301), 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-10-13 23:45:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15352 states to 15352 states and 17301 transitions. [2024-10-13 23:45:07,492 INFO L78 Accepts]: Start accepts. Automaton has 15352 states and 17301 transitions. Word has length 643 [2024-10-13 23:45:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:07,493 INFO L471 AbstractCegarLoop]: Abstraction has 15352 states and 17301 transitions. [2024-10-13 23:45:07,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) 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-10-13 23:45:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15352 states and 17301 transitions. [2024-10-13 23:45:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2024-10-13 23:45:07,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:07,500 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:45:07,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:45:07,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1594335830, now seen corresponding path program 1 times [2024-10-13 23:45:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361924983] [2024-10-13 23:45:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 124 proven. 390 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-13 23:45:08,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361924983] [2024-10-13 23:45:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361924983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:45:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688044118] [2024-10-13 23:45:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:45:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:45:08,455 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-10-13 23:45:08,460 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-10-13 23:45:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:08,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:45:08,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:45:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-13 23:45:08,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:45:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688044118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:08,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:45:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-13 23:45:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121204948] [2024-10-13 23:45:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:08,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:45:08,758 INFO L87 Difference]: Start difference. First operand 15352 states and 17301 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-13 23:45:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:10,030 INFO L93 Difference]: Finished difference Result 30400 states and 34267 transitions. [2024-10-13 23:45:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:10,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 664 [2024-10-13 23:45:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:10,045 INFO L225 Difference]: With dead ends: 30400 [2024-10-13 23:45:10,045 INFO L226 Difference]: Without dead ends: 15049 [2024-10-13 23:45:10,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:45:10,056 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 266 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:10,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:45:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15049 states. [2024-10-13 23:45:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15049 to 14450. [2024-10-13 23:45:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14450 states, 14449 states have (on average 1.08035158142432) internal successors, (15610), 14449 states have internal predecessors, (15610), 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-10-13 23:45:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14450 states to 14450 states and 15610 transitions. [2024-10-13 23:45:10,165 INFO L78 Accepts]: Start accepts. Automaton has 14450 states and 15610 transitions. Word has length 664 [2024-10-13 23:45:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:10,165 INFO L471 AbstractCegarLoop]: Abstraction has 14450 states and 15610 transitions. [2024-10-13 23:45:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-13 23:45:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14450 states and 15610 transitions. [2024-10-13 23:45:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-10-13 23:45:10,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:10,173 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:45:10,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:45:10,373 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,SelfDestructingSolverStorable14 [2024-10-13 23:45:10,374 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:10,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash -43890464, now seen corresponding path program 1 times [2024-10-13 23:45:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303659608] [2024-10-13 23:45:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-10-13 23:45:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303659608] [2024-10-13 23:45:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303659608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074594712] [2024-10-13 23:45:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:10,690 INFO L87 Difference]: Start difference. First operand 14450 states and 15610 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-13 23:45:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:11,978 INFO L93 Difference]: Finished difference Result 35473 states and 38352 transitions. [2024-10-13 23:45:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:11,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 688 [2024-10-13 23:45:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:11,998 INFO L225 Difference]: With dead ends: 35473 [2024-10-13 23:45:11,999 INFO L226 Difference]: Without dead ends: 21024 [2024-10-13 23:45:12,009 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-10-13 23:45:12,009 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 270 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:12,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 274 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:45:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21024 states. [2024-10-13 23:45:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21024 to 17435. [2024-10-13 23:45:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17435 states, 17434 states have (on average 1.0756567626476998) internal successors, (18753), 17434 states have internal predecessors, (18753), 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-10-13 23:45:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17435 states to 17435 states and 18753 transitions. [2024-10-13 23:45:12,151 INFO L78 Accepts]: Start accepts. Automaton has 17435 states and 18753 transitions. Word has length 688 [2024-10-13 23:45:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:12,152 INFO L471 AbstractCegarLoop]: Abstraction has 17435 states and 18753 transitions. [2024-10-13 23:45:12,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-10-13 23:45:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17435 states and 18753 transitions. [2024-10-13 23:45:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-10-13 23:45:12,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:12,161 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:45:12,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1574567064, now seen corresponding path program 1 times [2024-10-13 23:45:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925140936] [2024-10-13 23:45:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 629 proven. 190 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 23:45:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925140936] [2024-10-13 23:45:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925140936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:45:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021275659] [2024-10-13 23:45:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:12,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:45:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:45:12,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:45:12,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:45:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:12,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:45:12,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:45:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 734 proven. 85 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 23:45:13,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:45:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 734 proven. 85 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 23:45:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021275659] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 23:45:13,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 23:45:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-13 23:45:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941915828] [2024-10-13 23:45:13,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 23:45:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 23:45:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:13,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 23:45:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:45:13,510 INFO L87 Difference]: Start difference. First operand 17435 states and 18753 transitions. Second operand has 9 states, 9 states have (on average 143.44444444444446) internal successors, (1291), 9 states have internal predecessors, (1291), 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-10-13 23:45:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:21,397 INFO L93 Difference]: Finished difference Result 53202 states and 57211 transitions. [2024-10-13 23:45:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 23:45:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 143.44444444444446) internal successors, (1291), 9 states have internal predecessors, (1291), 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 695 [2024-10-13 23:45:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:21,432 INFO L225 Difference]: With dead ends: 53202 [2024-10-13 23:45:21,432 INFO L226 Difference]: Without dead ends: 35768 [2024-10-13 23:45:21,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1418 GetRequests, 1398 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-10-13 23:45:21,441 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4111 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 9933 mSolverCounterSat, 1282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1282 IncrementalHoareTripleChecker+Valid, 9933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:21,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 297 Invalid, 11215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1282 Valid, 9933 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-13 23:45:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35768 states. [2024-10-13 23:45:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35768 to 21625. [2024-10-13 23:45:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21625 states, 21624 states have (on average 1.0803274139844616) internal successors, (23361), 21624 states have internal predecessors, (23361), 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-10-13 23:45:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21625 states to 21625 states and 23361 transitions. [2024-10-13 23:45:21,736 INFO L78 Accepts]: Start accepts. Automaton has 21625 states and 23361 transitions. Word has length 695 [2024-10-13 23:45:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:21,737 INFO L471 AbstractCegarLoop]: Abstraction has 21625 states and 23361 transitions. [2024-10-13 23:45:21,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 143.44444444444446) internal successors, (1291), 9 states have internal predecessors, (1291), 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-10-13 23:45:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21625 states and 23361 transitions. [2024-10-13 23:45:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2024-10-13 23:45:21,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:21,751 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:45:21,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:45:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:45:21,952 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash 334111692, now seen corresponding path program 1 times [2024-10-13 23:45:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477999318] [2024-10-13 23:45:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-13 23:45:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477999318] [2024-10-13 23:45:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477999318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:45:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616963686] [2024-10-13 23:45:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:45:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:45:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:22,376 INFO L87 Difference]: Start difference. First operand 21625 states and 23361 transitions. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-10-13 23:45:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:23,947 INFO L93 Difference]: Finished difference Result 51626 states and 55586 transitions. [2024-10-13 23:45:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:45:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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 744 [2024-10-13 23:45:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:23,978 INFO L225 Difference]: With dead ends: 51626 [2024-10-13 23:45:23,978 INFO L226 Difference]: Without dead ends: 30002 [2024-10-13 23:45:23,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:23,994 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 665 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:23,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 196 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:45:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30002 states. [2024-10-13 23:45:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30002 to 24019. [2024-10-13 23:45:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24019 states, 24018 states have (on average 1.0788575235240236) internal successors, (25912), 24018 states have internal predecessors, (25912), 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-10-13 23:45:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24019 states to 24019 states and 25912 transitions. [2024-10-13 23:45:24,263 INFO L78 Accepts]: Start accepts. Automaton has 24019 states and 25912 transitions. Word has length 744 [2024-10-13 23:45:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:24,264 INFO L471 AbstractCegarLoop]: Abstraction has 24019 states and 25912 transitions. [2024-10-13 23:45:24,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-10-13 23:45:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24019 states and 25912 transitions. [2024-10-13 23:45:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2024-10-13 23:45:24,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:24,292 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:45:24,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:24,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2052250573, now seen corresponding path program 1 times [2024-10-13 23:45:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687715817] [2024-10-13 23:45:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-13 23:45:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687715817] [2024-10-13 23:45:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687715817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228294039] [2024-10-13 23:45:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:24,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:24,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:24,772 INFO L87 Difference]: Start difference. First operand 24019 states and 25912 transitions. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-10-13 23:45:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:26,319 INFO L93 Difference]: Finished difference Result 54926 states and 59231 transitions. [2024-10-13 23:45:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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 771 [2024-10-13 23:45:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:26,344 INFO L225 Difference]: With dead ends: 54926 [2024-10-13 23:45:26,345 INFO L226 Difference]: Without dead ends: 27619 [2024-10-13 23:45:26,359 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-10-13 23:45:26,360 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 189 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:26,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 654 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:45:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27619 states. [2024-10-13 23:45:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27619 to 26722. [2024-10-13 23:45:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26722 states, 26721 states have (on average 1.0637326447363498) internal successors, (28424), 26721 states have internal predecessors, (28424), 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-10-13 23:45:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26722 states to 26722 states and 28424 transitions. [2024-10-13 23:45:26,554 INFO L78 Accepts]: Start accepts. Automaton has 26722 states and 28424 transitions. Word has length 771 [2024-10-13 23:45:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:26,554 INFO L471 AbstractCegarLoop]: Abstraction has 26722 states and 28424 transitions. [2024-10-13 23:45:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-10-13 23:45:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26722 states and 28424 transitions. [2024-10-13 23:45:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2024-10-13 23:45:26,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:26,565 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:26,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:45:26,565 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1662407674, now seen corresponding path program 1 times [2024-10-13 23:45:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044989882] [2024-10-13 23:45:26,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2024-10-13 23:45:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044989882] [2024-10-13 23:45:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044989882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540106017] [2024-10-13 23:45:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:26,979 INFO L87 Difference]: Start difference. First operand 26722 states and 28424 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:28,281 INFO L93 Difference]: Finished difference Result 58241 states and 61957 transitions. [2024-10-13 23:45:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 784 [2024-10-13 23:45:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:28,312 INFO L225 Difference]: With dead ends: 58241 [2024-10-13 23:45:28,312 INFO L226 Difference]: Without dead ends: 31520 [2024-10-13 23:45:28,328 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-10-13 23:45:28,328 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 352 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:28,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 156 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 23:45:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31520 states. [2024-10-13 23:45:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31520 to 28214. [2024-10-13 23:45:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28214 states, 28213 states have (on average 1.0631978166093645) internal successors, (29996), 28213 states have internal predecessors, (29996), 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-10-13 23:45:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28214 states to 28214 states and 29996 transitions. [2024-10-13 23:45:28,564 INFO L78 Accepts]: Start accepts. Automaton has 28214 states and 29996 transitions. Word has length 784 [2024-10-13 23:45:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:28,564 INFO L471 AbstractCegarLoop]: Abstraction has 28214 states and 29996 transitions. [2024-10-13 23:45:28,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28214 states and 29996 transitions. [2024-10-13 23:45:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2024-10-13 23:45:28,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:28,574 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:45:28,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 631731744, now seen corresponding path program 1 times [2024-10-13 23:45:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305123552] [2024-10-13 23:45:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 23:45:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305123552] [2024-10-13 23:45:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305123552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:45:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357231877] [2024-10-13 23:45:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:29,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:45:29,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:45:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:29,111 INFO L87 Difference]: Start difference. First operand 28214 states and 29996 transitions. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-10-13 23:45:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:31,102 INFO L93 Difference]: Finished difference Result 69309 states and 73522 transitions. [2024-10-13 23:45:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:45:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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 797 [2024-10-13 23:45:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:31,140 INFO L225 Difference]: With dead ends: 69309 [2024-10-13 23:45:31,141 INFO L226 Difference]: Without dead ends: 41096 [2024-10-13 23:45:31,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:31,160 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 493 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:31,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 178 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:45:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41096 states. [2024-10-13 23:45:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41096 to 34200. [2024-10-13 23:45:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34200 states, 34199 states have (on average 1.062019357291149) internal successors, (36320), 34199 states have internal predecessors, (36320), 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-10-13 23:45:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34200 states to 34200 states and 36320 transitions. [2024-10-13 23:45:31,456 INFO L78 Accepts]: Start accepts. Automaton has 34200 states and 36320 transitions. Word has length 797 [2024-10-13 23:45:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:31,456 INFO L471 AbstractCegarLoop]: Abstraction has 34200 states and 36320 transitions. [2024-10-13 23:45:31,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-10-13 23:45:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34200 states and 36320 transitions. [2024-10-13 23:45:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-10-13 23:45:31,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:31,469 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:45:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:45:31,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:31,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1092216409, now seen corresponding path program 1 times [2024-10-13 23:45:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473401293] [2024-10-13 23:45:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 1084 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-13 23:45:31,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473401293] [2024-10-13 23:45:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473401293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:45:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321607044] [2024-10-13 23:45:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:31,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:45:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:45:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:31,886 INFO L87 Difference]: Start difference. First operand 34200 states and 36320 transitions. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 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-10-13 23:45:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:33,667 INFO L93 Difference]: Finished difference Result 78262 states and 82995 transitions. [2024-10-13 23:45:33,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:45:33,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 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 845 [2024-10-13 23:45:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:33,731 INFO L225 Difference]: With dead ends: 78262 [2024-10-13 23:45:33,731 INFO L226 Difference]: Without dead ends: 35392 [2024-10-13 23:45:33,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:33,759 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 611 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:33,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 441 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:45:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35392 states. [2024-10-13 23:45:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35392 to 28215. [2024-10-13 23:45:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28215 states, 28214 states have (on average 1.0281066137378607) internal successors, (29007), 28214 states have internal predecessors, (29007), 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-10-13 23:45:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28215 states to 28215 states and 29007 transitions. [2024-10-13 23:45:34,169 INFO L78 Accepts]: Start accepts. Automaton has 28215 states and 29007 transitions. Word has length 845 [2024-10-13 23:45:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 28215 states and 29007 transitions. [2024-10-13 23:45:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 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-10-13 23:45:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 28215 states and 29007 transitions. [2024-10-13 23:45:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2024-10-13 23:45:34,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:34,185 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:34,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:45:34,185 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:34,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:34,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1743483804, now seen corresponding path program 1 times [2024-10-13 23:45:34,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:34,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128711521] [2024-10-13 23:45:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2024-10-13 23:45:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128711521] [2024-10-13 23:45:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128711521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725784629] [2024-10-13 23:45:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:34,519 INFO L87 Difference]: Start difference. First operand 28215 states and 29007 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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-10-13 23:45:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:35,322 INFO L93 Difference]: Finished difference Result 46806 states and 48102 transitions. [2024-10-13 23:45:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 942 [2024-10-13 23:45:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:35,339 INFO L225 Difference]: With dead ends: 46806 [2024-10-13 23:45:35,340 INFO L226 Difference]: Without dead ends: 18592 [2024-10-13 23:45:35,351 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-10-13 23:45:35,352 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 340 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:35,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 361 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:45:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18592 states. [2024-10-13 23:45:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18592 to 15897. [2024-10-13 23:45:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15897 states, 15896 states have (on average 1.0226472068444892) internal successors, (16256), 15896 states have internal predecessors, (16256), 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-10-13 23:45:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15897 states to 15897 states and 16256 transitions. [2024-10-13 23:45:35,487 INFO L78 Accepts]: Start accepts. Automaton has 15897 states and 16256 transitions. Word has length 942 [2024-10-13 23:45:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 15897 states and 16256 transitions. [2024-10-13 23:45:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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-10-13 23:45:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15897 states and 16256 transitions. [2024-10-13 23:45:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2024-10-13 23:45:35,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:35,500 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 23:45:35,501 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1122671140, now seen corresponding path program 1 times [2024-10-13 23:45:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:35,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092062593] [2024-10-13 23:45:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-10-13 23:45:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092062593] [2024-10-13 23:45:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092062593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:45:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882412647] [2024-10-13 23:45:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:35,863 INFO L87 Difference]: Start difference. First operand 15897 states and 16256 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-10-13 23:45:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:36,570 INFO L93 Difference]: Finished difference Result 32988 states and 33751 transitions. [2024-10-13 23:45:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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 1001 [2024-10-13 23:45:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:36,585 INFO L225 Difference]: With dead ends: 32988 [2024-10-13 23:45:36,585 INFO L226 Difference]: Without dead ends: 16793 [2024-10-13 23:45:36,593 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-10-13 23:45:36,594 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 308 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:36,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 418 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:45:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2024-10-13 23:45:36,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 15296. [2024-10-13 23:45:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15296 states, 15295 states have (on average 1.0220333442301406) internal successors, (15632), 15295 states have internal predecessors, (15632), 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-10-13 23:45:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15296 states to 15296 states and 15632 transitions. [2024-10-13 23:45:36,705 INFO L78 Accepts]: Start accepts. Automaton has 15296 states and 15632 transitions. Word has length 1001 [2024-10-13 23:45:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:36,705 INFO L471 AbstractCegarLoop]: Abstraction has 15296 states and 15632 transitions. [2024-10-13 23:45:36,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-10-13 23:45:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 15296 states and 15632 transitions. [2024-10-13 23:45:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2024-10-13 23:45:36,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:36,718 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 23:45:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 23:45:36,718 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:36,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2049966136, now seen corresponding path program 1 times [2024-10-13 23:45:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644645208] [2024-10-13 23:45:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1293 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2024-10-13 23:45:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644645208] [2024-10-13 23:45:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644645208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:45:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156207983] [2024-10-13 23:45:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:37,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:45:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:45:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:37,387 INFO L87 Difference]: Start difference. First operand 15296 states and 15632 transitions. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-10-13 23:45:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:38,488 INFO L93 Difference]: Finished difference Result 18894 states and 19300 transitions. [2024-10-13 23:45:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:45:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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 1075 [2024-10-13 23:45:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:38,490 INFO L225 Difference]: With dead ends: 18894 [2024-10-13 23:45:38,490 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:45:38,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:45:38,496 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 394 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:38,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 57 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:45:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:45:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:45:38,497 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-10-13 23:45:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:45:38,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1075 [2024-10-13 23:45:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:45:38,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-10-13 23:45:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:45:38,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:45:38,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:45:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 23:45:38,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:38,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:45:46,388 WARN L286 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 548 DAG size of output: 734 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-13 23:45:49,819 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:45:49,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:45:49 BoogieIcfgContainer [2024-10-13 23:45:49,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:45:49,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:45:49,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:45:49,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:45:49,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:41" (3/4) ... [2024-10-13 23:45:49,849 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:45:49,868 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:45:49,870 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:45:49,871 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:45:49,873 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:45:50,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:45:50,066 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:45:50,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:45:50,066 INFO L158 Benchmark]: Toolchain (without parser) took 71453.48ms. Allocated memory was 188.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.4MB in the beginning and 928.2MB in the end (delta: -813.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-13 23:45:50,066 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.97ms. Allocated memory is still 188.7MB. Free memory was 114.1MB in the beginning and 86.1MB in the end (delta: 28.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 194.01ms. Allocated memory is still 188.7MB. Free memory was 86.1MB in the beginning and 115.1MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: Boogie Preprocessor took 307.81ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 115.1MB in the beginning and 218.7MB in the end (delta: -103.7MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: RCFGBuilder took 2011.59ms. Allocated memory is still 283.1MB. Free memory was 218.7MB in the beginning and 136.0MB in the end (delta: 82.7MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: TraceAbstraction took 67977.07ms. Allocated memory was 283.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 134.9MB in the beginning and 955.4MB in the end (delta: -820.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-13 23:45:50,067 INFO L158 Benchmark]: Witness Printer took 219.80ms. Allocated memory is still 2.0GB. Free memory was 955.4MB in the beginning and 928.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 23:45:50,068 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.08ms. Allocated memory is still 109.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.97ms. Allocated memory is still 188.7MB. Free memory was 114.1MB in the beginning and 86.1MB in the end (delta: 28.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 194.01ms. Allocated memory is still 188.7MB. Free memory was 86.1MB in the beginning and 115.1MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 307.81ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 115.1MB in the beginning and 218.7MB in the end (delta: -103.7MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2011.59ms. Allocated memory is still 283.1MB. Free memory was 218.7MB in the beginning and 136.0MB in the end (delta: 82.7MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * TraceAbstraction took 67977.07ms. Allocated memory was 283.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 134.9MB in the beginning and 955.4MB in the end (delta: -820.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 219.80ms. Allocated memory is still 2.0GB. Free memory was 955.4MB in the beginning and 928.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 209]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.6s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11507 SdHoareTripleChecker+Valid, 36.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11507 mSDsluCounter, 9676 SdHoareTripleChecker+Invalid, 31.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1034 mSDsCounter, 5745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33676 IncrementalHoareTripleChecker+Invalid, 39421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5745 mSolverCounterUnsat, 8642 mSDtfsCounter, 33676 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2772 GetRequests, 2717 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34200occurred in iteration=21, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 53405 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 15917 NumberOfCodeBlocks, 15917 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 16583 ConstructedInterpolants, 0 QuantifiedInterpolants, 39566 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2365 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 19058/19847 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((44 <= a29) && (((long long) 89 + a4) <= 0)) && (a2 == 1)) || ((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0)) && (0 <= ((long long) a29 + 192415)))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((2 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (((long long) 366639 + a0) <= 0))) || ((((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 104 + a0) <= 0) && (2 == a2)) && (44 <= a29)) && (0 <= ((long long) 600001 + a0)))) || ((((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || ((((((0 <= ((long long) 140 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43)) && (0 <= ((long long) a29 + 192415)))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) 140 + a0))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (5 <= a2))) || ((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 1)) && (0 <= ((long long) 600001 + a0)))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((92 <= a0) && (((long long) 89 + a4) <= 0)) && (a2 == 4))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) && (0 <= ((long long) a29 + 192415)))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 146 + a0)))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (0 <= ((long long) a29 + 192415)))) || ((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 600001 + a0))) && (0 <= ((long long) a29 + 192415)))) || ((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 4)) && (0 <= ((long long) 600001 + a0)))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 127) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:45:50,117 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