./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/Problem16_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/Problem16_label07.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 a8cf6243f0ab4090e55b0c0c5f0ae4cf837fa81bc993d776b406c2b0dbd3865c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:21:50,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:21:50,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:21:50,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:21:50,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:21:50,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:21:50,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:21:50,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:21:50,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:21:50,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:21:50,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:21:50,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:21:50,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:21:50,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:21:50,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:21:50,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:21:50,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:21:50,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:21:50,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:21:50,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:21:50,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:21:50,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:21:50,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:21:50,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:21:50,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:21:50,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:21:50,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:21:50,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:21:50,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:21:50,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:21:50,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:21:50,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:21:50,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:21:50,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:21:50,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:21:50,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:21:50,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:21:50,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:21:50,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:21:50,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:21:50,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:21:50,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:21:50,714 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 -> a8cf6243f0ab4090e55b0c0c5f0ae4cf837fa81bc993d776b406c2b0dbd3865c [2024-10-12 16:21:50,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:21:50,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:21:51,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:21:51,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:21:51,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:21:51,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label07.c [2024-10-12 16:21:52,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:21:52,745 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:21:52,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label07.c [2024-10-12 16:21:52,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99a3be1a/57971b18ee8f4dcea57faca1a80f19eb/FLAGa9a6bd695 [2024-10-12 16:21:52,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99a3be1a/57971b18ee8f4dcea57faca1a80f19eb [2024-10-12 16:21:52,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:21:52,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:21:52,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:21:52,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:21:52,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:21:52,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:21:52" (1/1) ... [2024-10-12 16:21:52,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4739ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:52, skipping insertion in model container [2024-10-12 16:21:52,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:21:52" (1/1) ... [2024-10-12 16:21:52,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:21:53,065 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/Problem16_label07.c[5709,5722] [2024-10-12 16:21:53,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:21:53,412 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:21:53,432 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/Problem16_label07.c[5709,5722] [2024-10-12 16:21:53,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:21:53,552 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:21:53,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53 WrapperNode [2024-10-12 16:21:53,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:21:53,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:21:53,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:21:53,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:21:53,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,675 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-12 16:21:53,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:21:53,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:21:53,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:21:53,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:21:53,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,746 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-12 16:21:53,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:21:53,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:21:53,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:21:53,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:21:53,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (1/1) ... [2024-10-12 16:21:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:21:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:53,974 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-12 16:21:53,981 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-12 16:21:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:21:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:21:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:21:54,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:21:54,062 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:21:54,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:21:55,577 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-12 16:21:55,578 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:21:55,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:21:55,631 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:21:55,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:55 BoogieIcfgContainer [2024-10-12 16:21:55,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:21:55,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:21:55,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:21:55,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:21:55,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:21:52" (1/3) ... [2024-10-12 16:21:55,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec929f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:21:55, skipping insertion in model container [2024-10-12 16:21:55,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:53" (2/3) ... [2024-10-12 16:21:55,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec929f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:21:55, skipping insertion in model container [2024-10-12 16:21:55,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:55" (3/3) ... [2024-10-12 16:21:55,638 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label07.c [2024-10-12 16:21:55,651 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:21:55,651 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:21:55,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:21:55,723 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;@32f195e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:21:55,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:21:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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-12 16:21:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 16:21:55,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:55,734 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] [2024-10-12 16:21:55,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:55,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1156182994, now seen corresponding path program 1 times [2024-10-12 16:21:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961617076] [2024-10-12 16:21:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:55,873 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-12 16:21:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961617076] [2024-10-12 16:21:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961617076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:55,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930163098] [2024-10-12 16:21:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:21:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:21:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:21:55,905 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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-12 16:21:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:55,943 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-12 16:21:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:21:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 16:21:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:55,954 INFO L225 Difference]: With dead ends: 667 [2024-10-12 16:21:55,954 INFO L226 Difference]: Without dead ends: 332 [2024-10-12 16:21:55,957 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-12 16:21:55,959 INFO L432 NwaCegarLoop]: 596 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, 596 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-12 16:21:55,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:21:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-12 16:21:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-12 16:21:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:21:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-12 16:21:56,000 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 53 [2024-10-12 16:21:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-12 16:21:56,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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-12 16:21:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-12 16:21:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 16:21:56,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:56,002 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] [2024-10-12 16:21:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:21:56,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2124978222, now seen corresponding path program 1 times [2024-10-12 16:21:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286956924] [2024-10-12 16:21:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:56,134 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-12 16:21:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286956924] [2024-10-12 16:21:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286956924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510105934] [2024-10-12 16:21:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:56,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:56,137 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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-12 16:21:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:57,310 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-12 16:21:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:57,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 16:21:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:57,315 INFO L225 Difference]: With dead ends: 992 [2024-10-12 16:21:57,315 INFO L226 Difference]: Without dead ends: 661 [2024-10-12 16:21:57,316 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-12 16:21:57,317 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 317 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:57,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 199 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:21:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-12 16:21:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-12 16:21:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 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-12 16:21:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2024-10-12 16:21:57,339 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 53 [2024-10-12 16:21:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:57,339 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2024-10-12 16:21:57,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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-12 16:21:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2024-10-12 16:21:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 16:21:57,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:57,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:21:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:21:57,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash -471871128, now seen corresponding path program 1 times [2024-10-12 16:21:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647098270] [2024-10-12 16:21:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647098270] [2024-10-12 16:21:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647098270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:57,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295003648] [2024-10-12 16:21:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:57,572 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-12 16:21:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:58,922 INFO L93 Difference]: Finished difference Result 1979 states and 3006 transitions. [2024-10-12 16:21:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-12 16:21:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:58,926 INFO L225 Difference]: With dead ends: 1979 [2024-10-12 16:21:58,927 INFO L226 Difference]: Without dead ends: 1319 [2024-10-12 16:21:58,928 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-12 16:21:58,929 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:58,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 214 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:21:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-12 16:21:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-12 16:21:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.456752655538695) internal successors, (1920), 1318 states have internal predecessors, (1920), 0 states have call successors, (0), 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-12 16:21:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1920 transitions. [2024-10-12 16:21:58,958 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1920 transitions. Word has length 121 [2024-10-12 16:21:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:58,958 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1920 transitions. [2024-10-12 16:21:58,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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-12 16:21:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1920 transitions. [2024-10-12 16:21:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 16:21:58,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:58,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:21:58,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:21:58,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:58,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1199498103, now seen corresponding path program 1 times [2024-10-12 16:21:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24156351] [2024-10-12 16:21:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24156351] [2024-10-12 16:21:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24156351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:59,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:59,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:59,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140524498] [2024-10-12 16:21:59,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:59,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:59,047 INFO L87 Difference]: Start difference. First operand 1319 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-12 16:22:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:00,100 INFO L93 Difference]: Finished difference Result 3953 states and 5757 transitions. [2024-10-12 16:22:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-12 16:22:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:00,108 INFO L225 Difference]: With dead ends: 3953 [2024-10-12 16:22:00,108 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 16:22:00,110 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-12 16:22:00,111 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:00,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 153 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:22:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 16:22:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-12 16:22:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3249810174639332) internal successors, (3490), 2634 states have internal predecessors, (3490), 0 states have call successors, (0), 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-12 16:22:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3490 transitions. [2024-10-12 16:22:00,149 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3490 transitions. Word has length 132 [2024-10-12 16:22:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:00,149 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3490 transitions. [2024-10-12 16:22:00,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-12 16:22:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3490 transitions. [2024-10-12 16:22:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-12 16:22:00,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:00,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:00,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:22:00,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash -641163129, now seen corresponding path program 1 times [2024-10-12 16:22:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401013136] [2024-10-12 16:22:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:22:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401013136] [2024-10-12 16:22:00,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401013136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:00,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:00,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:22:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207138409] [2024-10-12 16:22:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:00,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:00,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:00,405 INFO L87 Difference]: Start difference. First operand 2635 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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-12 16:22:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:01,338 INFO L93 Difference]: Finished difference Result 6585 states and 8549 transitions. [2024-10-12 16:22:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2024-10-12 16:22:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:01,348 INFO L225 Difference]: With dead ends: 6585 [2024-10-12 16:22:01,348 INFO L226 Difference]: Without dead ends: 3951 [2024-10-12 16:22:01,351 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-12 16:22:01,351 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:01,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 81 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:22:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-12 16:22:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-12 16:22:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2172151898734178) internal successors, (4808), 3950 states have internal predecessors, (4808), 0 states have call successors, (0), 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-12 16:22:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4808 transitions. [2024-10-12 16:22:01,399 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4808 transitions. Word has length 184 [2024-10-12 16:22:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4808 transitions. [2024-10-12 16:22:01,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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-12 16:22:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4808 transitions. [2024-10-12 16:22:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-12 16:22:01,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:01,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:22:01,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2124294013, now seen corresponding path program 1 times [2024-10-12 16:22:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607432211] [2024-10-12 16:22:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:22:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607432211] [2024-10-12 16:22:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607432211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:01,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214043682] [2024-10-12 16:22:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:01,733 INFO L87 Difference]: Start difference. First operand 3951 states and 4808 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-12 16:22:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:02,888 INFO L93 Difference]: Finished difference Result 9546 states and 11835 transitions. [2024-10-12 16:22:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 288 [2024-10-12 16:22:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:02,906 INFO L225 Difference]: With dead ends: 9546 [2024-10-12 16:22:02,907 INFO L226 Difference]: Without dead ends: 5596 [2024-10-12 16:22:02,912 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-12 16:22:02,913 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 278 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:02,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 592 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:22:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-12 16:22:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-12 16:22:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.1801608579088472) internal successors, (6603), 5595 states have internal predecessors, (6603), 0 states have call successors, (0), 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-12 16:22:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6603 transitions. [2024-10-12 16:22:02,987 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6603 transitions. Word has length 288 [2024-10-12 16:22:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:02,988 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6603 transitions. [2024-10-12 16:22:02,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-12 16:22:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6603 transitions. [2024-10-12 16:22:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-12 16:22:02,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:02,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:22:02,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:02,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2125682346, now seen corresponding path program 1 times [2024-10-12 16:22:02,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216435960] [2024-10-12 16:22:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:22:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:03,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216435960] [2024-10-12 16:22:03,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216435960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479707343] [2024-10-12 16:22:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:22:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:03,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:22:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:22:03,430 INFO L87 Difference]: Start difference. First operand 5596 states and 6603 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-12 16:22:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:04,878 INFO L93 Difference]: Finished difference Result 11520 states and 13546 transitions. [2024-10-12 16:22:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:22:04,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2024-10-12 16:22:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:04,893 INFO L225 Difference]: With dead ends: 11520 [2024-10-12 16:22:04,893 INFO L226 Difference]: Without dead ends: 5925 [2024-10-12 16:22:04,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:22:04,898 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:04,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:22:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-12 16:22:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2024-10-12 16:22:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.1711681296421337) internal successors, (6938), 5924 states have internal predecessors, (6938), 0 states have call successors, (0), 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-12 16:22:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6938 transitions. [2024-10-12 16:22:04,964 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6938 transitions. Word has length 298 [2024-10-12 16:22:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:04,964 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6938 transitions. [2024-10-12 16:22:04,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-12 16:22:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6938 transitions. [2024-10-12 16:22:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-10-12 16:22:04,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:04,968 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:22:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:22:04,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1189282877, now seen corresponding path program 1 times [2024-10-12 16:22:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482350471] [2024-10-12 16:22:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:22:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482350471] [2024-10-12 16:22:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482350471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 16:22:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963092794] [2024-10-12 16:22:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 16:22:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 16:22:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:22:05,413 INFO L87 Difference]: Start difference. First operand 5925 states and 6938 transitions. Second operand has 7 states, 7 states have (on average 55.0) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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-12 16:22:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:06,929 INFO L93 Difference]: Finished difference Result 11379 states and 13387 transitions. [2024-10-12 16:22:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 16:22:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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 385 [2024-10-12 16:22:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:06,943 INFO L225 Difference]: With dead ends: 11379 [2024-10-12 16:22:06,943 INFO L226 Difference]: Without dead ends: 5596 [2024-10-12 16:22:06,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:22:06,949 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 289 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:06,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 291 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:22:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-12 16:22:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-12 16:22:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.068811438784629) internal successors, (5980), 5595 states have internal predecessors, (5980), 0 states have call successors, (0), 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-12 16:22:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5980 transitions. [2024-10-12 16:22:06,997 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5980 transitions. Word has length 385 [2024-10-12 16:22:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:06,998 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5980 transitions. [2024-10-12 16:22:06,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 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-12 16:22:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5980 transitions. [2024-10-12 16:22:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-12 16:22:07,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:07,001 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:22:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:22:07,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2132890717, now seen corresponding path program 1 times [2024-10-12 16:22:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331522816] [2024-10-12 16:22:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 16:22:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331522816] [2024-10-12 16:22:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331522816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:22:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592253991] [2024-10-12 16:22:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:07,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:22:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:22:07,419 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-12 16:22:07,421 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-12 16:22:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:07,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:22:07,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:22:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-12 16:22:08,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:22:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592253991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:22:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 16:22:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901219664] [2024-10-12 16:22:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:22:08,132 INFO L87 Difference]: Start difference. First operand 5596 states and 5980 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-12 16:22:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:08,844 INFO L93 Difference]: Finished difference Result 7243 states and 7668 transitions. [2024-10-12 16:22:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 392 [2024-10-12 16:22:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:08,859 INFO L225 Difference]: With dead ends: 7243 [2024-10-12 16:22:08,860 INFO L226 Difference]: Without dead ends: 7241 [2024-10-12 16:22:08,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:22:08,862 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:08,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:22:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2024-10-12 16:22:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 6254. [2024-10-12 16:22:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.065248680633296) internal successors, (6661), 6253 states have internal predecessors, (6661), 0 states have call successors, (0), 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-12 16:22:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6661 transitions. [2024-10-12 16:22:08,922 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6661 transitions. Word has length 392 [2024-10-12 16:22:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:08,923 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6661 transitions. [2024-10-12 16:22:08,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-12 16:22:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6661 transitions. [2024-10-12 16:22:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-10-12 16:22:08,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:08,932 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:08,947 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-12 16:22:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:22:09,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:09,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1614729594, now seen corresponding path program 1 times [2024-10-12 16:22:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:09,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558747219] [2024-10-12 16:22:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-12 16:22:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558747219] [2024-10-12 16:22:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558747219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:09,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458333122] [2024-10-12 16:22:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:09,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:09,625 INFO L87 Difference]: Start difference. First operand 6254 states and 6661 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-12 16:22:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:10,636 INFO L93 Difference]: Finished difference Result 14481 states and 15545 transitions. [2024-10-12 16:22:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 628 [2024-10-12 16:22:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:10,665 INFO L225 Difference]: With dead ends: 14481 [2024-10-12 16:22:10,665 INFO L226 Difference]: Without dead ends: 8557 [2024-10-12 16:22:10,673 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-12 16:22:10,674 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:10,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 36 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:22:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2024-10-12 16:22:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 8557. [2024-10-12 16:22:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8557 states, 8556 states have (on average 1.0697755960729314) internal successors, (9153), 8556 states have internal predecessors, (9153), 0 states have call successors, (0), 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-12 16:22:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 9153 transitions. [2024-10-12 16:22:10,766 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 9153 transitions. Word has length 628 [2024-10-12 16:22:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:10,767 INFO L471 AbstractCegarLoop]: Abstraction has 8557 states and 9153 transitions. [2024-10-12 16:22:10,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-12 16:22:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 9153 transitions. [2024-10-12 16:22:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2024-10-12 16:22:10,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:10,780 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:22:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:22:10,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1799385450, now seen corresponding path program 1 times [2024-10-12 16:22:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779194090] [2024-10-12 16:22:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-12 16:22:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779194090] [2024-10-12 16:22:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779194090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099412199] [2024-10-12 16:22:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:11,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:11,151 INFO L87 Difference]: Start difference. First operand 8557 states and 9153 transitions. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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-12 16:22:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:11,945 INFO L93 Difference]: Finished difference Result 19416 states and 20869 transitions. [2024-10-12 16:22:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:11,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 717 [2024-10-12 16:22:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:11,960 INFO L225 Difference]: With dead ends: 19416 [2024-10-12 16:22:11,960 INFO L226 Difference]: Without dead ends: 11189 [2024-10-12 16:22:11,967 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-12 16:22:11,968 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:11,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 437 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:22:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-12 16:22:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 10202. [2024-10-12 16:22:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.062738947162043) internal successors, (10841), 10201 states have internal predecessors, (10841), 0 states have call successors, (0), 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-12 16:22:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10841 transitions. [2024-10-12 16:22:12,061 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10841 transitions. Word has length 717 [2024-10-12 16:22:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10841 transitions. [2024-10-12 16:22:12,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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-12 16:22:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10841 transitions. [2024-10-12 16:22:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2024-10-12 16:22:12,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:12,069 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:22:12,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:22:12,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:12,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:12,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1469826305, now seen corresponding path program 1 times [2024-10-12 16:22:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692703325] [2024-10-12 16:22:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-10-12 16:22:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692703325] [2024-10-12 16:22:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692703325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:12,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974866202] [2024-10-12 16:22:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:12,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:12,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:12,425 INFO L87 Difference]: Start difference. First operand 10202 states and 10841 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 16:22:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:13,250 INFO L93 Difference]: Finished difference Result 20074 states and 21350 transitions. [2024-10-12 16:22:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 718 [2024-10-12 16:22:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:13,264 INFO L225 Difference]: With dead ends: 20074 [2024-10-12 16:22:13,265 INFO L226 Difference]: Without dead ends: 10202 [2024-10-12 16:22:13,274 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-12 16:22:13,275 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 313 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:13,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 374 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:22:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2024-10-12 16:22:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 10202. [2024-10-12 16:22:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.055680815606313) internal successors, (10769), 10201 states have internal predecessors, (10769), 0 states have call successors, (0), 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-12 16:22:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10769 transitions. [2024-10-12 16:22:13,367 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10769 transitions. Word has length 718 [2024-10-12 16:22:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:13,368 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10769 transitions. [2024-10-12 16:22:13,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 16:22:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10769 transitions. [2024-10-12 16:22:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2024-10-12 16:22:13,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:13,384 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:22:13,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:22:13,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:13,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1377369659, now seen corresponding path program 1 times [2024-10-12 16:22:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175065892] [2024-10-12 16:22:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1678 backedges. 966 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-10-12 16:22:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175065892] [2024-10-12 16:22:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175065892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:13,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782906504] [2024-10-12 16:22:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:13,827 INFO L87 Difference]: Start difference. First operand 10202 states and 10769 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-12 16:22:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:14,556 INFO L93 Difference]: Finished difference Result 25009 states and 26497 transitions. [2024-10-12 16:22:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 888 [2024-10-12 16:22:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:14,572 INFO L225 Difference]: With dead ends: 25009 [2024-10-12 16:22:14,572 INFO L226 Difference]: Without dead ends: 14150 [2024-10-12 16:22:14,582 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-12 16:22:14,582 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 271 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:14,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 426 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:22:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2024-10-12 16:22:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 13163. [2024-10-12 16:22:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0468013979638353) internal successors, (13778), 13162 states have internal predecessors, (13778), 0 states have call successors, (0), 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-12 16:22:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13778 transitions. [2024-10-12 16:22:14,680 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13778 transitions. Word has length 888 [2024-10-12 16:22:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13778 transitions. [2024-10-12 16:22:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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-12 16:22:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13778 transitions. [2024-10-12 16:22:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2024-10-12 16:22:14,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:14,697 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2024-10-12 16:22:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:22:14,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:14,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -917065853, now seen corresponding path program 1 times [2024-10-12 16:22:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414839749] [2024-10-12 16:22:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 1733 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2024-10-12 16:22:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414839749] [2024-10-12 16:22:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414839749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 16:22:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391943079] [2024-10-12 16:22:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:15,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 16:22:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:15,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 16:22:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:22:15,905 INFO L87 Difference]: Start difference. First operand 13163 states and 13778 transitions. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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-12 16:22:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:17,194 INFO L93 Difference]: Finished difference Result 25997 states and 27225 transitions. [2024-10-12 16:22:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 16:22:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 1157 [2024-10-12 16:22:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:17,211 INFO L225 Difference]: With dead ends: 25997 [2024-10-12 16:22:17,212 INFO L226 Difference]: Without dead ends: 13164 [2024-10-12 16:22:17,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:22:17,224 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 209 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:17,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 569 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:22:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-10-12 16:22:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13163. [2024-10-12 16:22:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.045129919465127) internal successors, (13756), 13162 states have internal predecessors, (13756), 0 states have call successors, (0), 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-12 16:22:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13756 transitions. [2024-10-12 16:22:17,425 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13756 transitions. Word has length 1157 [2024-10-12 16:22:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:17,426 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13756 transitions. [2024-10-12 16:22:17,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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-12 16:22:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13756 transitions. [2024-10-12 16:22:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2024-10-12 16:22:17,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:17,452 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:22:17,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 71800428, now seen corresponding path program 1 times [2024-10-12 16:22:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859473345] [2024-10-12 16:22:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 1563 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-10-12 16:22:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859473345] [2024-10-12 16:22:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859473345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:22:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444950268] [2024-10-12 16:22:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:18,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:22:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:22:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:22:18,669 INFO L87 Difference]: Start difference. First operand 13163 states and 13756 transitions. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 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-12 16:22:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:19,554 INFO L93 Difference]: Finished difference Result 26007 states and 27191 transitions. [2024-10-12 16:22:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 16:22:19,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 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) Word has length 1171 [2024-10-12 16:22:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:19,570 INFO L225 Difference]: With dead ends: 26007 [2024-10-12 16:22:19,571 INFO L226 Difference]: Without dead ends: 13174 [2024-10-12 16:22:19,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:22:19,580 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 218 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:19,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 442 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:22:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13174 states. [2024-10-12 16:22:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13174 to 12834. [2024-10-12 16:22:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0455855996259642) internal successors, (13418), 12833 states have internal predecessors, (13418), 0 states have call successors, (0), 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-12 16:22:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13418 transitions. [2024-10-12 16:22:19,699 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13418 transitions. Word has length 1171 [2024-10-12 16:22:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:19,700 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13418 transitions. [2024-10-12 16:22:19,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 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-12 16:22:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13418 transitions. [2024-10-12 16:22:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1174 [2024-10-12 16:22:19,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:19,764 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:22:19,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:22:19,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -325230652, now seen corresponding path program 1 times [2024-10-12 16:22:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798739799] [2024-10-12 16:22:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-12 16:22:20,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:20,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798739799] [2024-10-12 16:22:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798739799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:20,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:20,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016907974] [2024-10-12 16:22:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:20,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:20,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:20,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:20,235 INFO L87 Difference]: Start difference. First operand 12834 states and 13418 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-12 16:22:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:20,885 INFO L93 Difference]: Finished difference Result 27312 states and 28566 transitions. [2024-10-12 16:22:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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 1173 [2024-10-12 16:22:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:20,897 INFO L225 Difference]: With dead ends: 27312 [2024-10-12 16:22:20,897 INFO L226 Difference]: Without dead ends: 13163 [2024-10-12 16:22:20,904 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-12 16:22:20,905 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 234 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:20,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 416 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:22:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-12 16:22:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 11518. [2024-10-12 16:22:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 1.0332551879829817) internal successors, (11900), 11517 states have internal predecessors, (11900), 0 states have call successors, (0), 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-12 16:22:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 11900 transitions. [2024-10-12 16:22:21,031 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 11900 transitions. Word has length 1173 [2024-10-12 16:22:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:21,032 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 11900 transitions. [2024-10-12 16:22:21,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-12 16:22:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 11900 transitions. [2024-10-12 16:22:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2024-10-12 16:22:21,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:21,048 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:22:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:22:21,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1824100967, now seen corresponding path program 1 times [2024-10-12 16:22:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646076480] [2024-10-12 16:22:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 2536 proven. 0 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2024-10-12 16:22:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646076480] [2024-10-12 16:22:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646076480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500375002] [2024-10-12 16:22:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:21,560 INFO L87 Difference]: Start difference. First operand 11518 states and 11900 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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-12 16:22:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:22,355 INFO L93 Difference]: Finished difference Result 23035 states and 23798 transitions. [2024-10-12 16:22:22,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 1347 [2024-10-12 16:22:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:22,368 INFO L225 Difference]: With dead ends: 23035 [2024-10-12 16:22:22,368 INFO L226 Difference]: Without dead ends: 11518 [2024-10-12 16:22:22,374 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-12 16:22:22,376 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:22,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 416 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:22:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2024-10-12 16:22:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 11189. [2024-10-12 16:22:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0244905255631034) internal successors, (11462), 11188 states have internal predecessors, (11462), 0 states have call successors, (0), 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-12 16:22:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 11462 transitions. [2024-10-12 16:22:22,481 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 11462 transitions. Word has length 1347 [2024-10-12 16:22:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:22,482 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 11462 transitions. [2024-10-12 16:22:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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-12 16:22:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 11462 transitions. [2024-10-12 16:22:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1525 [2024-10-12 16:22:22,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:22,513 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:22:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:22:22,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash 253978468, now seen corresponding path program 1 times [2024-10-12 16:22:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103843322] [2024-10-12 16:22:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4295 backedges. 2683 proven. 0 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2024-10-12 16:22:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103843322] [2024-10-12 16:22:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103843322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847706325] [2024-10-12 16:22:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:23,755 INFO L87 Difference]: Start difference. First operand 11189 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 16:22:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:24,401 INFO L93 Difference]: Finished difference Result 22706 states and 23261 transitions. [2024-10-12 16:22:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:24,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 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 1524 [2024-10-12 16:22:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:24,411 INFO L225 Difference]: With dead ends: 22706 [2024-10-12 16:22:24,411 INFO L226 Difference]: Without dead ends: 11847 [2024-10-12 16:22:24,417 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-12 16:22:24,418 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:24,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 428 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:22:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2024-10-12 16:22:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 11847. [2024-10-12 16:22:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.0235522539253756) internal successors, (12125), 11846 states have internal predecessors, (12125), 0 states have call successors, (0), 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-12 16:22:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 12125 transitions. [2024-10-12 16:22:24,492 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 12125 transitions. Word has length 1524 [2024-10-12 16:22:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 12125 transitions. [2024-10-12 16:22:24,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 16:22:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 12125 transitions. [2024-10-12 16:22:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1579 [2024-10-12 16:22:24,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:22:24,511 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:22:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:22:24,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:22:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:22:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -890208673, now seen corresponding path program 1 times [2024-10-12 16:22:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:22:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617798339] [2024-10-12 16:22:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:22:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:22:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:22:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2024-10-12 16:22:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:22:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617798339] [2024-10-12 16:22:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617798339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:22:25,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:22:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:22:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283353593] [2024-10-12 16:22:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:22:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:22:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:22:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:22:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:22:25,399 INFO L87 Difference]: Start difference. First operand 11847 states and 12125 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-12 16:22:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:22:26,048 INFO L93 Difference]: Finished difference Result 28955 states and 29660 transitions. [2024-10-12 16:22:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:22:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 1578 [2024-10-12 16:22:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:22:26,049 INFO L225 Difference]: With dead ends: 28955 [2024-10-12 16:22:26,050 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:22:26,061 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-12 16:22:26,062 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 280 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:22:26,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 35 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:22:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:22:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:22:26,063 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-12 16:22:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:22:26,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1578 [2024-10-12 16:22:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:22:26,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:22:26,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-12 16:22:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:22:26,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:22:26,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:22:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:22:26,068 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] [2024-10-12 16:22:26,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:22:26,919 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:22:26,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:22:26 BoogieIcfgContainer [2024-10-12 16:22:26,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:22:26,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:22:26,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:22:26,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:22:26,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:55" (3/4) ... [2024-10-12 16:22:26,943 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:22:26,964 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:22:26,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:22:26,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:22:26,972 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:22:27,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:22:27,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:22:27,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:22:27,122 INFO L158 Benchmark]: Toolchain (without parser) took 34347.57ms. Allocated memory was 224.4MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 151.7MB in the beginning and 843.3MB in the end (delta: -691.6MB). Peak memory consumption was 748.0MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,122 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 115.3MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:22:27,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.47ms. Allocated memory is still 224.4MB. Free memory was 151.7MB in the beginning and 156.5MB in the end (delta: -4.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.93ms. Allocated memory is still 224.4MB. Free memory was 156.5MB in the beginning and 132.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,123 INFO L158 Benchmark]: Boogie Preprocessor took 262.65ms. Allocated memory is still 224.4MB. Free memory was 132.5MB in the beginning and 174.3MB in the end (delta: -41.8MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,123 INFO L158 Benchmark]: RCFGBuilder took 1692.19ms. Allocated memory was 224.4MB in the beginning and 402.7MB in the end (delta: 178.3MB). Free memory was 174.3MB in the beginning and 294.2MB in the end (delta: -120.0MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,127 INFO L158 Benchmark]: TraceAbstraction took 31306.26ms. Allocated memory was 402.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 293.2MB in the beginning and 869.5MB in the end (delta: -576.3MB). Peak memory consumption was 685.1MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,127 INFO L158 Benchmark]: Witness Printer took 181.15ms. Allocated memory is still 1.7GB. Free memory was 869.5MB in the beginning and 843.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:22:27,128 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.11ms. Allocated memory is still 115.3MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.47ms. Allocated memory is still 224.4MB. Free memory was 151.7MB in the beginning and 156.5MB in the end (delta: -4.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.93ms. Allocated memory is still 224.4MB. Free memory was 156.5MB in the beginning and 132.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 262.65ms. Allocated memory is still 224.4MB. Free memory was 132.5MB in the beginning and 174.3MB in the end (delta: -41.8MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1692.19ms. Allocated memory was 224.4MB in the beginning and 402.7MB in the end (delta: 178.3MB). Free memory was 174.3MB in the beginning and 294.2MB in the end (delta: -120.0MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31306.26ms. Allocated memory was 402.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 293.2MB in the beginning and 869.5MB in the end (delta: -576.3MB). Peak memory consumption was 685.1MB. Max. memory is 16.1GB. * Witness Printer took 181.15ms. Allocated memory is still 1.7GB. Free memory was 869.5MB in the beginning and 843.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 179]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4420 SdHoareTripleChecker+Valid, 16.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4420 mSDsluCounter, 6104 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 2377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18815 IncrementalHoareTripleChecker+Invalid, 21192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2377 mSolverCounterUnsat, 5802 mSDtfsCounter, 18815 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13163occurred in iteration=13, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 5276 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 13199 NumberOfCodeBlocks, 13199 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 13179 ConstructedInterpolants, 0 QuantifiedInterpolants, 28100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 25250/25286 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: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a15 <= 3) && (0 <= ((long long) a18 + 151))) && (a12 <= 7)) && (11 <= a16)) || (((a16 == 8) && (5 == a12)) && (a15 == 3))) || ((a12 == 9) && (a16 == 9))) || (((a12 == 9) && (a16 == 8)) && (a15 <= 3))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || ((a12 == 6) && (a16 <= 11))) || ((a16 == 9) && (a15 <= 3))) || (((a16 == 8) && (a12 == 8)) && (0 <= ((long long) a18 + 151)))) || (((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || ((a16 == 9) && (a12 == 8))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || (((a12 == 9) && (a16 == 8)) && (0 <= ((long long) a18 + 151)))) || (((a16 == 8) && (a15 <= 3)) && (0 <= ((long long) a18 + 151)))) || ((a15 <= 3) && (a12 == 8))) || (((0 <= ((long long) a18 + 151)) && (5 == a12)) && (a15 == 3))) || (((a16 == 11) && (a15 <= 3)) && (a12 <= 7))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) || ((a16 == 9) && (a12 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:22:27,170 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