./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_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_label25.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 b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:25:50,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:25:50,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:25:50,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:25:50,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:25:50,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:25:50,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:25:50,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:25:50,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:25:50,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:25:50,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:25:50,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:25:50,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:25:50,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:25:50,859 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:25:50,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:25:50,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:25:50,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:25:50,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:25:50,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:25:50,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:25:50,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:25:50,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:25:50,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:25:50,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:25:50,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:25:50,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:25:50,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:25:50,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:25:50,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:25:50,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:25:50,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:25:50,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:25:50,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:25:50,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:25:50,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:25:50,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:25:50,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:25:50,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:25:50,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:25:50,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:25:50,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:25:50,868 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 -> b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 [2024-10-23 21:25:51,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:25:51,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:25:51,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:25:51,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:25:51,152 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:25:51,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-10-23 21:25:52,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:25:52,971 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:25:52,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-10-23 21:25:53,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3835c89/a99684496f2f48bc82d8bd68cced1c9c/FLAG66f495933 [2024-10-23 21:25:53,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3835c89/a99684496f2f48bc82d8bd68cced1c9c [2024-10-23 21:25:53,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:25:53,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:25:53,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:25:53,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:25:53,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:25:53,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:25:53" (1/1) ... [2024-10-23 21:25:53,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf11ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:53, skipping insertion in model container [2024-10-23 21:25:53,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:25:53" (1/1) ... [2024-10-23 21:25:53,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:25:53,519 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_label25.c[5318,5331] [2024-10-23 21:25:53,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:25:53,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:25:53,914 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_label25.c[5318,5331] [2024-10-23 21:25:54,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:25:54,177 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:25:54,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54 WrapperNode [2024-10-23 21:25:54,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:25:54,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:25:54,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:25:54,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:25:54,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,338 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-23 21:25:54,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:25:54,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:25:54,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:25:54,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:25:54,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,420 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-23 21:25:54,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:25:54,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:25:54,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:25:54,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:25:54,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (1/1) ... [2024-10-23 21:25:54,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:25:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:54,624 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-23 21:25:54,628 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-23 21:25:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:25:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:25:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:25:54,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:25:54,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:25:54,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:25:56,632 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-23 21:25:56,633 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:25:56,725 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:25:56,729 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:25:56,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:56 BoogieIcfgContainer [2024-10-23 21:25:56,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:25:56,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:25:56,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:25:56,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:25:56,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:25:53" (1/3) ... [2024-10-23 21:25:56,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4b146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:25:56, skipping insertion in model container [2024-10-23 21:25:56,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:54" (2/3) ... [2024-10-23 21:25:56,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4b146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:25:56, skipping insertion in model container [2024-10-23 21:25:56,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:56" (3/3) ... [2024-10-23 21:25:56,740 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label25.c [2024-10-23 21:25:56,756 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:25:56,756 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:25:56,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:25:56,850 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;@54522319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:25:56,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:25:56,857 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-23 21:25:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-23 21:25:56,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:56,866 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] [2024-10-23 21:25:56,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:56,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1596310217, now seen corresponding path program 1 times [2024-10-23 21:25:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:56,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852802214] [2024-10-23 21:25:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:57,075 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-23 21:25:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852802214] [2024-10-23 21:25:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852802214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931407360] [2024-10-23 21:25:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:25:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:57,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:25:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:25:57,114 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-23 21:25:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:57,174 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-23 21:25:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:25:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-23 21:25:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:57,192 INFO L225 Difference]: With dead ends: 667 [2024-10-23 21:25:57,193 INFO L226 Difference]: Without dead ends: 332 [2024-10-23 21:25:57,197 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-23 21:25:57,202 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-23 21:25:57,203 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-23 21:25:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-23 21:25:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-23 21:25:57,261 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-23 21:25:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-23 21:25:57,264 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 49 [2024-10-23 21:25:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-23 21:25:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-23 21:25:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-23 21:25:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-23 21:25:57,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:57,267 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] [2024-10-23 21:25:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:25:57,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2111666783, now seen corresponding path program 1 times [2024-10-23 21:25:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662862547] [2024-10-23 21:25:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:57,489 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-23 21:25:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662862547] [2024-10-23 21:25:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662862547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868582350] [2024-10-23 21:25:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:57,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:57,493 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-23 21:25:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:59,279 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-23 21:25:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-23 21:25:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:59,284 INFO L225 Difference]: With dead ends: 992 [2024-10-23 21:25:59,284 INFO L226 Difference]: Without dead ends: 661 [2024-10-23 21:25:59,285 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-23 21:25:59,287 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 300 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:59,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:25:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-23 21:25:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-23 21:25:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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-23 21:25:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-23 21:25:59,316 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 49 [2024-10-23 21:25:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:59,317 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-23 21:25:59,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-23 21:25:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-23 21:25:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-23 21:25:59,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:59,321 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, 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-23 21:25:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:25:59,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1420260030, now seen corresponding path program 1 times [2024-10-23 21:25:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664048282] [2024-10-23 21:25:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664048282] [2024-10-23 21:25:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664048282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179181060] [2024-10-23 21:25:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:59,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:59,508 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-23 21:26:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:00,805 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-23 21:26:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-23 21:26:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:00,814 INFO L225 Difference]: With dead ends: 1979 [2024-10-23 21:26:00,814 INFO L226 Difference]: Without dead ends: 1319 [2024-10-23 21:26:00,816 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-23 21:26:00,817 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:00,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:26:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-23 21:26:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-23 21:26:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 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-23 21:26:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-23 21:26:00,855 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 115 [2024-10-23 21:26:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:00,856 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-23 21:26:00,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-23 21:26:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-23 21:26:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-23 21:26:00,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:00,860 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, 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-23 21:26:00,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:26:00,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1662130166, now seen corresponding path program 1 times [2024-10-23 21:26:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045075616] [2024-10-23 21:26:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045075616] [2024-10-23 21:26:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045075616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:01,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:26:01,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297796733] [2024-10-23 21:26:01,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:01,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:01,046 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-23 21:26:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:02,371 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-23 21:26:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:02,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-23 21:26:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:02,382 INFO L225 Difference]: With dead ends: 3295 [2024-10-23 21:26:02,382 INFO L226 Difference]: Without dead ends: 1977 [2024-10-23 21:26:02,386 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-23 21:26:02,387 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:02,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:26:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-23 21:26:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-23 21:26:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 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-23 21:26:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-23 21:26:02,425 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 116 [2024-10-23 21:26:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:02,426 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-23 21:26:02,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-23 21:26:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-23 21:26:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-23 21:26:02,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:02,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:26:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:26:02,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1731941104, now seen corresponding path program 1 times [2024-10-23 21:26:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533027820] [2024-10-23 21:26:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533027820] [2024-10-23 21:26:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533027820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:26:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421215490] [2024-10-23 21:26:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:02,704 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-23 21:26:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:04,082 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-23 21:26:04,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-10-23 21:26:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:04,098 INFO L225 Difference]: With dead ends: 5927 [2024-10-23 21:26:04,098 INFO L226 Difference]: Without dead ends: 3951 [2024-10-23 21:26:04,102 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-23 21:26:04,104 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:04,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:26:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-23 21:26:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-23 21:26:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 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-23 21:26:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-23 21:26:04,178 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 208 [2024-10-23 21:26:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:04,180 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-23 21:26:04,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 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-23 21:26:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-23 21:26:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-23 21:26:04,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:04,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:26:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:26:04,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1367546169, now seen corresponding path program 1 times [2024-10-23 21:26:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655621600] [2024-10-23 21:26:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:04,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655621600] [2024-10-23 21:26:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655621600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347829422] [2024-10-23 21:26:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:04,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:26:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:04,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:26:04,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:26:04,872 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-23 21:26:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:06,122 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-23 21:26:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:26:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2024-10-23 21:26:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:06,139 INFO L225 Difference]: With dead ends: 8230 [2024-10-23 21:26:06,140 INFO L226 Difference]: Without dead ends: 4280 [2024-10-23 21:26:06,146 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-23 21:26:06,147 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:06,148 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.2s Time] [2024-10-23 21:26:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-23 21:26:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-23 21:26:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 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-23 21:26:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-23 21:26:06,226 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 294 [2024-10-23 21:26:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:06,227 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-23 21:26:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-23 21:26:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-23 21:26:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-23 21:26:06,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:06,233 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:26:06,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:26:06,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1985964300, now seen corresponding path program 1 times [2024-10-23 21:26:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105782337] [2024-10-23 21:26:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:06,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105782337] [2024-10-23 21:26:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105782337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:26:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385638869] [2024-10-23 21:26:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 21:26:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:06,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 21:26:06,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:06,860 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-23 21:26:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:08,503 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-23 21:26:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 21:26:08,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2024-10-23 21:26:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:08,516 INFO L225 Difference]: With dead ends: 8089 [2024-10-23 21:26:08,516 INFO L226 Difference]: Without dead ends: 3951 [2024-10-23 21:26:08,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:08,522 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:08,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:26:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-23 21:26:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-23 21:26:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 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-23 21:26:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-23 21:26:08,583 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 381 [2024-10-23 21:26:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:08,584 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-23 21:26:08,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.42857142857143) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 0 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-23 21:26:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-23 21:26:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-23 21:26:08,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:08,589 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:26:08,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:26:08,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -599706958, now seen corresponding path program 1 times [2024-10-23 21:26:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537610803] [2024-10-23 21:26:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:26:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537610803] [2024-10-23 21:26:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537610803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:08,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501515961] [2024-10-23 21:26:08,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:08,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:08,935 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-23 21:26:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:09,917 INFO L93 Difference]: Finished difference Result 9217 states and 10059 transitions. [2024-10-23 21:26:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 388 [2024-10-23 21:26:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:09,934 INFO L225 Difference]: With dead ends: 9217 [2024-10-23 21:26:09,935 INFO L226 Difference]: Without dead ends: 5596 [2024-10-23 21:26:09,940 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-23 21:26:09,941 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:09,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 403 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:26:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-23 21:26:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-23 21:26:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0748882931188561) internal successors, (6014), 5595 states have internal predecessors, (6014), 0 states have call successors, (0), 0 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-23 21:26:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6014 transitions. [2024-10-23 21:26:10,037 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6014 transitions. Word has length 388 [2024-10-23 21:26:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6014 transitions. [2024-10-23 21:26:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-23 21:26:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6014 transitions. [2024-10-23 21:26:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-23 21:26:10,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:10,045 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:26:10,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:26:10,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:10,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1553494339, now seen corresponding path program 1 times [2024-10-23 21:26:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452386837] [2024-10-23 21:26:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452386837] [2024-10-23 21:26:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452386837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728357987] [2024-10-23 21:26:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:10,424 INFO L87 Difference]: Start difference. First operand 5596 states and 6014 transitions. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-23 21:26:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:11,352 INFO L93 Difference]: Finished difference Result 10862 states and 11696 transitions. [2024-10-23 21:26:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 443 [2024-10-23 21:26:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:11,370 INFO L225 Difference]: With dead ends: 10862 [2024-10-23 21:26:11,371 INFO L226 Difference]: Without dead ends: 5596 [2024-10-23 21:26:11,377 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-23 21:26:11,378 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 178 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:11,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 414 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:26:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-23 21:26:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-23 21:26:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0491510277033065) internal successors, (5870), 5595 states have internal predecessors, (5870), 0 states have call successors, (0), 0 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-23 21:26:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5870 transitions. [2024-10-23 21:26:11,462 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5870 transitions. Word has length 443 [2024-10-23 21:26:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5870 transitions. [2024-10-23 21:26:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-23 21:26:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5870 transitions. [2024-10-23 21:26:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-10-23 21:26:11,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:11,474 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:26:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:26:11,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:11,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1485346541, now seen corresponding path program 1 times [2024-10-23 21:26:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864727432] [2024-10-23 21:26:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:26:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864727432] [2024-10-23 21:26:12,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864727432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:12,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:12,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:12,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404649235] [2024-10-23 21:26:12,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:12,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:26:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:12,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:26:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:26:12,008 INFO L87 Difference]: Start difference. First operand 5596 states and 5870 transitions. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 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-23 21:26:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:13,471 INFO L93 Difference]: Finished difference Result 16457 states and 17283 transitions. [2024-10-23 21:26:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:26:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 527 [2024-10-23 21:26:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:13,513 INFO L225 Difference]: With dead ends: 16457 [2024-10-23 21:26:13,514 INFO L226 Difference]: Without dead ends: 11191 [2024-10-23 21:26:13,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:26:13,522 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:13,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 96 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:26:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2024-10-23 21:26:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 9215. [2024-10-23 21:26:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0493813761667028) internal successors, (9669), 9214 states have internal predecessors, (9669), 0 states have call successors, (0), 0 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-23 21:26:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9669 transitions. [2024-10-23 21:26:13,693 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9669 transitions. Word has length 527 [2024-10-23 21:26:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:13,693 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9669 transitions. [2024-10-23 21:26:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 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-23 21:26:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9669 transitions. [2024-10-23 21:26:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-10-23 21:26:13,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:13,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:13,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:26:13,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1490232739, now seen corresponding path program 1 times [2024-10-23 21:26:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366760572] [2024-10-23 21:26:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:26:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366760572] [2024-10-23 21:26:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366760572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467223290] [2024-10-23 21:26:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:14,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:14,020 INFO L87 Difference]: Start difference. First operand 9215 states and 9669 transitions. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-23 21:26:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:14,931 INFO L93 Difference]: Finished difference Result 21061 states and 22143 transitions. [2024-10-23 21:26:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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 547 [2024-10-23 21:26:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:14,953 INFO L225 Difference]: With dead ends: 21061 [2024-10-23 21:26:14,954 INFO L226 Difference]: Without dead ends: 12176 [2024-10-23 21:26:14,965 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-23 21:26:14,966 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:14,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 36 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:26:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2024-10-23 21:26:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 11518. [2024-10-23 21:26:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 1.046800382043935) internal successors, (12056), 11517 states have internal predecessors, (12056), 0 states have call successors, (0), 0 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-23 21:26:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 12056 transitions. [2024-10-23 21:26:15,143 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 12056 transitions. Word has length 547 [2024-10-23 21:26:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 12056 transitions. [2024-10-23 21:26:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-23 21:26:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 12056 transitions. [2024-10-23 21:26:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-10-23 21:26:15,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:15,152 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:15,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:26:15,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:15,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash -527319900, now seen corresponding path program 1 times [2024-10-23 21:26:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60231088] [2024-10-23 21:26:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-23 21:26:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60231088] [2024-10-23 21:26:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60231088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848715716] [2024-10-23 21:26:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:26:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:26:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:26:15,904 INFO L87 Difference]: Start difference. First operand 11518 states and 12056 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-23 21:26:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:16,792 INFO L93 Difference]: Finished difference Result 23035 states and 24114 transitions. [2024-10-23 21:26:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 601 [2024-10-23 21:26:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:16,811 INFO L225 Difference]: With dead ends: 23035 [2024-10-23 21:26:16,812 INFO L226 Difference]: Without dead ends: 11847 [2024-10-23 21:26:16,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:26:16,821 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:16,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 116 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:26:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2024-10-23 21:26:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 11847. [2024-10-23 21:26:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.0456694242782374) internal successors, (12387), 11846 states have internal predecessors, (12387), 0 states have call successors, (0), 0 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-23 21:26:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 12387 transitions. [2024-10-23 21:26:16,956 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 12387 transitions. Word has length 601 [2024-10-23 21:26:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:16,956 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 12387 transitions. [2024-10-23 21:26:16,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-23 21:26:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 12387 transitions. [2024-10-23 21:26:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2024-10-23 21:26:16,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:16,963 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:16,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:26:16,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:16,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1914747960, now seen corresponding path program 1 times [2024-10-23 21:26:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652877099] [2024-10-23 21:26:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:16,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-23 21:26:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652877099] [2024-10-23 21:26:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652877099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837350354] [2024-10-23 21:26:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:17,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:17,437 INFO L87 Difference]: Start difference. First operand 11847 states and 12387 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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-23 21:26:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:18,079 INFO L93 Difference]: Finished difference Result 23035 states and 24111 transitions. [2024-10-23 21:26:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 662 [2024-10-23 21:26:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:18,099 INFO L225 Difference]: With dead ends: 23035 [2024-10-23 21:26:18,099 INFO L226 Difference]: Without dead ends: 11847 [2024-10-23 21:26:18,110 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-23 21:26:18,111 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 297 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:18,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 424 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2024-10-23 21:26:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 10860. [2024-10-23 21:26:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0427295331061792) internal successors, (11323), 10859 states have internal predecessors, (11323), 0 states have call successors, (0), 0 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-23 21:26:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11323 transitions. [2024-10-23 21:26:18,236 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11323 transitions. Word has length 662 [2024-10-23 21:26:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11323 transitions. [2024-10-23 21:26:18,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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-23 21:26:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11323 transitions. [2024-10-23 21:26:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-10-23 21:26:18,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:18,250 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:18,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:26:18,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:18,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1349136587, now seen corresponding path program 1 times [2024-10-23 21:26:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:18,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127725211] [2024-10-23 21:26:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-10-23 21:26:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127725211] [2024-10-23 21:26:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127725211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:19,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991168383] [2024-10-23 21:26:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:19,065 INFO L87 Difference]: Start difference. First operand 10860 states and 11323 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-23 21:26:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:19,834 INFO L93 Difference]: Finished difference Result 24022 states and 25130 transitions. [2024-10-23 21:26:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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 851 [2024-10-23 21:26:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:19,858 INFO L225 Difference]: With dead ends: 24022 [2024-10-23 21:26:19,858 INFO L226 Difference]: Without dead ends: 13821 [2024-10-23 21:26:19,868 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-23 21:26:19,869 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:19,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 440 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:26:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-23 21:26:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2024-10-23 21:26:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0415590335815226) internal successors, (13709), 13162 states have internal predecessors, (13709), 0 states have call successors, (0), 0 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-23 21:26:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13709 transitions. [2024-10-23 21:26:20,013 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13709 transitions. Word has length 851 [2024-10-23 21:26:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:20,014 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13709 transitions. [2024-10-23 21:26:20,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-23 21:26:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13709 transitions. [2024-10-23 21:26:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2024-10-23 21:26:20,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:20,088 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:26:20,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:26:20,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:20,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1161171519, now seen corresponding path program 1 times [2024-10-23 21:26:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454974559] [2024-10-23 21:26:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-10-23 21:26:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454974559] [2024-10-23 21:26:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454974559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462238659] [2024-10-23 21:26:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:20,702 INFO L87 Difference]: Start difference. First operand 13163 states and 13709 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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-23 21:26:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:21,470 INFO L93 Difference]: Finished difference Result 30602 states and 31961 transitions. [2024-10-23 21:26:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 860 [2024-10-23 21:26:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:21,492 INFO L225 Difference]: With dead ends: 30602 [2024-10-23 21:26:21,492 INFO L226 Difference]: Without dead ends: 16453 [2024-10-23 21:26:21,501 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-23 21:26:21,502 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 289 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 427 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-23 21:26:21,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:26:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-23 21:26:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16124. [2024-10-23 21:26:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.032872294238045) internal successors, (16653), 16123 states have internal predecessors, (16653), 0 states have call successors, (0), 0 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-23 21:26:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16653 transitions. [2024-10-23 21:26:21,669 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16653 transitions. Word has length 860 [2024-10-23 21:26:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:21,670 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16653 transitions. [2024-10-23 21:26:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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-23 21:26:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16653 transitions. [2024-10-23 21:26:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2024-10-23 21:26:21,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:21,690 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:26:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:26:21,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1722448950, now seen corresponding path program 1 times [2024-10-23 21:26:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726481768] [2024-10-23 21:26:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2024-10-23 21:26:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726481768] [2024-10-23 21:26:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726481768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667315985] [2024-10-23 21:26:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:23,098 INFO L87 Difference]: Start difference. First operand 16124 states and 16653 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 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-23 21:26:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:23,840 INFO L93 Difference]: Finished difference Result 31589 states and 32643 transitions. [2024-10-23 21:26:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 1076 [2024-10-23 21:26:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:23,856 INFO L225 Difference]: With dead ends: 31589 [2024-10-23 21:26:23,856 INFO L226 Difference]: Without dead ends: 16124 [2024-10-23 21:26:23,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-23 21:26:23,865 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:23,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 374 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:26:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-23 21:26:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-23 21:26:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0286547168641071) internal successors, (16585), 16123 states have internal predecessors, (16585), 0 states have call successors, (0), 0 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-23 21:26:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16585 transitions. [2024-10-23 21:26:24,045 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16585 transitions. Word has length 1076 [2024-10-23 21:26:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:24,047 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16585 transitions. [2024-10-23 21:26:24,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 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-23 21:26:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16585 transitions. [2024-10-23 21:26:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2024-10-23 21:26:24,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:24,069 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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-23 21:26:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:26:24,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 478826713, now seen corresponding path program 1 times [2024-10-23 21:26:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406422226] [2024-10-23 21:26:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 1790 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-23 21:26:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406422226] [2024-10-23 21:26:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406422226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:24,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329930924] [2024-10-23 21:26:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:24,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:24,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:24,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:24,713 INFO L87 Difference]: Start difference. First operand 16124 states and 16585 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-23 21:26:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:25,429 INFO L93 Difference]: Finished difference Result 31589 states and 32507 transitions. [2024-10-23 21:26:25,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1133 [2024-10-23 21:26:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:25,449 INFO L225 Difference]: With dead ends: 31589 [2024-10-23 21:26:25,449 INFO L226 Difference]: Without dead ends: 16124 [2024-10-23 21:26:25,461 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-23 21:26:25,462 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:25,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 425 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-23 21:26:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 14808. [2024-10-23 21:26:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0228945768893092) internal successors, (15146), 14807 states have internal predecessors, (15146), 0 states have call successors, (0), 0 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-23 21:26:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15146 transitions. [2024-10-23 21:26:25,603 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15146 transitions. Word has length 1133 [2024-10-23 21:26:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:25,603 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15146 transitions. [2024-10-23 21:26:25,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-23 21:26:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15146 transitions. [2024-10-23 21:26:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2024-10-23 21:26:25,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:25,623 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-23 21:26:25,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-23 21:26:25,623 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1413327840, now seen corresponding path program 1 times [2024-10-23 21:26:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577374205] [2024-10-23 21:26:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-23 21:26:26,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577374205] [2024-10-23 21:26:26,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577374205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:26,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:26,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:26,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203371484] [2024-10-23 21:26:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:26,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:26,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:26,228 INFO L87 Difference]: Start difference. First operand 14808 states and 15146 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-23 21:26:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:26,924 INFO L93 Difference]: Finished difference Result 32247 states and 33029 transitions. [2024-10-23 21:26:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 1134 [2024-10-23 21:26:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:26,942 INFO L225 Difference]: With dead ends: 32247 [2024-10-23 21:26:26,942 INFO L226 Difference]: Without dead ends: 15795 [2024-10-23 21:26:26,954 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-23 21:26:26,955 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 274 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:26,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 408 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2024-10-23 21:26:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 13163. [2024-10-23 21:26:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0198298130983132) internal successors, (13423), 13162 states have internal predecessors, (13423), 0 states have call successors, (0), 0 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-23 21:26:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13423 transitions. [2024-10-23 21:26:27,182 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13423 transitions. Word has length 1134 [2024-10-23 21:26:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:27,183 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13423 transitions. [2024-10-23 21:26:27,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-23 21:26:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13423 transitions. [2024-10-23 21:26:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2024-10-23 21:26:27,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:27,206 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-23 21:26:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:26:27,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628761, now seen corresponding path program 1 times [2024-10-23 21:26:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905103456] [2024-10-23 21:26:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4062 backedges. 2503 proven. 0 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2024-10-23 21:26:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905103456] [2024-10-23 21:26:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905103456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412056918] [2024-10-23 21:26:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:28,583 INFO L87 Difference]: Start difference. First operand 13163 states and 13423 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 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-23 21:26:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:29,266 INFO L93 Difference]: Finished difference Result 26325 states and 26849 transitions. [2024-10-23 21:26:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1389 [2024-10-23 21:26:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:29,277 INFO L225 Difference]: With dead ends: 26325 [2024-10-23 21:26:29,277 INFO L226 Difference]: Without dead ends: 13821 [2024-10-23 21:26:29,286 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-23 21:26:29,286 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:29,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 427 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-23 21:26:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-23 21:26:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0191751085383502) internal successors, (14085), 13820 states have internal predecessors, (14085), 0 states have call successors, (0), 0 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-23 21:26:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14085 transitions. [2024-10-23 21:26:29,388 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14085 transitions. Word has length 1389 [2024-10-23 21:26:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:29,389 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14085 transitions. [2024-10-23 21:26:29,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 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-23 21:26:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14085 transitions. [2024-10-23 21:26:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1428 [2024-10-23 21:26:29,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:29,411 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-23 21:26:29,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 21:26:29,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 203494091, now seen corresponding path program 1 times [2024-10-23 21:26:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736998873] [2024-10-23 21:26:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3823 backedges. 2719 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-23 21:26:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736998873] [2024-10-23 21:26:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736998873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:26:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654280976] [2024-10-23 21:26:30,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 21:26:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:30,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 21:26:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:26:30,634 INFO L87 Difference]: Start difference. First operand 13821 states and 14085 transitions. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-23 21:26:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:31,929 INFO L93 Difference]: Finished difference Result 26984 states and 27508 transitions. [2024-10-23 21:26:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 21:26:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 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 1427 [2024-10-23 21:26:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:31,942 INFO L225 Difference]: With dead ends: 26984 [2024-10-23 21:26:31,942 INFO L226 Difference]: Without dead ends: 13822 [2024-10-23 21:26:31,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:31,949 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 209 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:31,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 555 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:26:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-10-23 21:26:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13821. [2024-10-23 21:26:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0188856729377713) internal successors, (14081), 13820 states have internal predecessors, (14081), 0 states have call successors, (0), 0 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-23 21:26:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14081 transitions. [2024-10-23 21:26:32,051 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14081 transitions. Word has length 1427 [2024-10-23 21:26:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:32,051 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14081 transitions. [2024-10-23 21:26:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-23 21:26:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14081 transitions. [2024-10-23 21:26:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2024-10-23 21:26:32,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:32,067 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-23 21:26:32,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 21:26:32,067 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:32,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -460050444, now seen corresponding path program 1 times [2024-10-23 21:26:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034073230] [2024-10-23 21:26:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3689 backedges. 2622 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-23 21:26:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034073230] [2024-10-23 21:26:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034073230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473020886] [2024-10-23 21:26:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:33,291 INFO L87 Difference]: Start difference. First operand 13821 states and 14081 transitions. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 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-23 21:26:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:34,040 INFO L93 Difference]: Finished difference Result 26983 states and 27499 transitions. [2024-10-23 21:26:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:34,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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 1441 [2024-10-23 21:26:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:34,051 INFO L225 Difference]: With dead ends: 26983 [2024-10-23 21:26:34,051 INFO L226 Difference]: Without dead ends: 13821 [2024-10-23 21:26:34,058 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-23 21:26:34,059 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:34,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 423 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:26:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-23 21:26:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-23 21:26:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0185962373371924) internal successors, (14077), 13820 states have internal predecessors, (14077), 0 states have call successors, (0), 0 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-23 21:26:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14077 transitions. [2024-10-23 21:26:34,153 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14077 transitions. Word has length 1441 [2024-10-23 21:26:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:34,154 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14077 transitions. [2024-10-23 21:26:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 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-23 21:26:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14077 transitions. [2024-10-23 21:26:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1444 [2024-10-23 21:26:34,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:34,169 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-23 21:26:34,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 21:26:34,169 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:34,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1044815156, now seen corresponding path program 1 times [2024-10-23 21:26:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231692860] [2024-10-23 21:26:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2024-10-23 21:26:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231692860] [2024-10-23 21:26:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231692860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:26:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:26:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169856788] [2024-10-23 21:26:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:26:35,035 INFO L87 Difference]: Start difference. First operand 13821 states and 14077 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-23 21:26:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:35,754 INFO L93 Difference]: Finished difference Result 26981 states and 27490 transitions. [2024-10-23 21:26:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:35,755 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 1443 [2024-10-23 21:26:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:35,757 INFO L225 Difference]: With dead ends: 26981 [2024-10-23 21:26:35,757 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:26:35,766 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-23 21:26:35,766 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:35,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 410 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:26:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:26:35,767 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-23 21:26:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:26:35,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1443 [2024-10-23 21:26:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:26:35,768 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-23 21:26:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:26:35,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:26:35,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:26:35,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-23 21:26:35,775 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:35,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:26:37,175 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:26:37,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:26:37 BoogieIcfgContainer [2024-10-23 21:26:37,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:26:37,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:26:37,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:26:37,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:26:37,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:56" (3/4) ... [2024-10-23 21:26:37,221 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:26:37,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-23 21:26:37,253 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:26:37,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:26:37,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:26:37,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:26:37,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:26:37,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:26:37,463 INFO L158 Benchmark]: Toolchain (without parser) took 44239.37ms. Allocated memory was 153.1MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 93.9MB in the beginning and 1.1GB in the end (delta: -990.8MB). Peak memory consumption was 811.4MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,463 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory was 116.9MB in the beginning and 116.7MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:26:37,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 953.24ms. Allocated memory is still 153.1MB. Free memory was 93.9MB in the beginning and 104.4MB in the end (delta: -10.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.53ms. Allocated memory is still 153.1MB. Free memory was 104.4MB in the beginning and 80.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,466 INFO L158 Benchmark]: Boogie Preprocessor took 247.37ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 80.6MB in the beginning and 167.7MB in the end (delta: -87.0MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,467 INFO L158 Benchmark]: RCFGBuilder took 2142.15ms. Allocated memory is still 220.2MB. Free memory was 167.7MB in the beginning and 158.5MB in the end (delta: 9.2MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,467 INFO L158 Benchmark]: TraceAbstraction took 40485.68ms. Allocated memory was 220.2MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 157.4MB in the beginning and 1.1GB in the end (delta: -953.5MB). Peak memory consumption was 778.8MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,467 INFO L158 Benchmark]: Witness Printer took 243.97ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 21:26:37,468 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.18ms. Allocated memory is still 153.1MB. Free memory was 116.9MB in the beginning and 116.7MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 953.24ms. Allocated memory is still 153.1MB. Free memory was 93.9MB in the beginning and 104.4MB in the end (delta: -10.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.53ms. Allocated memory is still 153.1MB. Free memory was 104.4MB in the beginning and 80.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 247.37ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 80.6MB in the beginning and 167.7MB in the end (delta: -87.0MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2142.15ms. Allocated memory is still 220.2MB. Free memory was 167.7MB in the beginning and 158.5MB in the end (delta: 9.2MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40485.68ms. Allocated memory was 220.2MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 157.4MB in the beginning and 1.1GB in the end (delta: -953.5MB). Peak memory consumption was 778.8MB. Max. memory is 16.1GB. * Witness Printer took 243.97ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 167]: 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: 39.0s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4687 SdHoareTripleChecker+Valid, 20.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4687 mSDsluCounter, 7139 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 2713 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21030 IncrementalHoareTripleChecker+Invalid, 23743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2713 mSolverCounterUnsat, 6834 mSDtfsCounter, 21030 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16124occurred in iteration=15, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 8557 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 15134 NumberOfCodeBlocks, 15134 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 15112 ConstructedInterpolants, 0 QuantifiedInterpolants, 32138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 27973/27973 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: (((((((((((((((((((((((((((((((a16 == 9) && (7 == a12)) || ((a16 == 10) && (a12 == 6))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((((a16 == 11) && (5 == a12)) && (((long long) 87 + a18) == 0)) && (a15 == 3))) || ((((5 == a12) && (a16 <= 11)) && (a15 == 3)) && (83 <= a18))) || (((a12 == 9) && (a15 <= 3)) && (a16 == 12))) || (((a12 <= 5) && (a16 == 10)) && (a15 != 3))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 8)) && (a16 <= 11))) || ((a12 == 9) && (a16 == 9))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 10)) && (5 == a12))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((a16 == 8) && (5 == a12))) || ((a16 == 8) && (a12 == 6))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || (((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6)) && (a16 == 12))) || ((a16 == 9) && (5 == a12))) || ((a16 == 9) && (a12 == 8))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || ((a12 == 9) && (a16 == 8))) || (((a16 == 10) && (a15 <= 3)) && (a12 == 8))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a12 == 8))) || ((((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a15 <= 3)) && (7 <= a12))) || (((a16 == 9) && (a15 != 3)) && (a12 == 6))) || ((((a15 <= 3) && (a12 == 6)) && (((long long) 87 + a18) == 0)) && (a16 <= 11))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) || (((a12 <= 5) && (a16 == 8)) && (a15 != 3))) || (((a12 <= 5) && (a16 == 9)) && (a15 != 3))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:26:37,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE