./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.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 c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:55:03,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:55:03,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:55:03,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:55:03,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:55:03,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:55:03,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:55:03,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:55:03,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:55:03,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:55:03,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:55:03,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:55:03,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:55:03,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:55:03,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:55:03,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:55:03,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:55:03,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:55:03,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:55:03,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:55:03,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:55:03,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:55:03,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:55:03,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:55:03,224 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:55:03,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:55:03,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:55:03,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:55:03,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:55:03,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:55:03,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:55:03,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:55:03,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:03,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:55:03,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:55:03,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:55:03,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:55:03,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:55:03,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:55:03,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:55:03,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:55:03,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:55:03,232 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 -> c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a [2024-11-10 00:55:03,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:55:03,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:55:03,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:55:03,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:55:03,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:55:03,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:55:05,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:55:05,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:55:05,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:55:05,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c3a0224/2637f8478fb34a568199f5fc75872730/FLAGcb314a3e9 [2024-11-10 00:55:05,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c3a0224/2637f8478fb34a568199f5fc75872730 [2024-11-10 00:55:05,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:55:05,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:55:05,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:05,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:55:05,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:55:05,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:05" (1/1) ... [2024-11-10 00:55:05,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11451a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:05, skipping insertion in model container [2024-11-10 00:55:05,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:05" (1/1) ... [2024-11-10 00:55:05,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:55:06,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2024-11-10 00:55:06,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2024-11-10 00:55:06,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:06,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:55:06,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2024-11-10 00:55:06,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2024-11-10 00:55:07,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:07,378 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:55:07,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07 WrapperNode [2024-11-10 00:55:07,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:07,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:07,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:55:07,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:55:07,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:07,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:07,815 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-11-10 00:55:07,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:07,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:55:07,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:55:07,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:55:07,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:07,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:07,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,066 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:55:08,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:55:08,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:55:08,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:55:08,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:55:08,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (1/1) ... [2024-11-10 00:55:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:08,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:08,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:55:08,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:55:08,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:55:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:55:08,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:55:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:55:08,559 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:55:08,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:55:14,221 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2024-11-10 00:55:14,221 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:55:14,222 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:55:14,505 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:55:14,506 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:55:14,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:55:14,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:55:14,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:14 BoogieIcfgContainer [2024-11-10 00:55:14,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:55:14,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:55:14,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:55:14,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:55:14,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:05" (1/3) ... [2024-11-10 00:55:14,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11254d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:14, skipping insertion in model container [2024-11-10 00:55:14,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:07" (2/3) ... [2024-11-10 00:55:14,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11254d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:14, skipping insertion in model container [2024-11-10 00:55:14,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:14" (3/3) ... [2024-11-10 00:55:14,568 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:55:14,585 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:55:14,586 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:55:14,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:55:14,700 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;@25f01196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:55:14,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:55:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:55:14,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:14,724 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] [2024-11-10 00:55:14,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1381072168, now seen corresponding path program 1 times [2024-11-10 00:55:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102553735] [2024-11-10 00:55:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102553735] [2024-11-10 00:55:15,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102553735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:15,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:55:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125914347] [2024-11-10 00:55:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:15,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:55:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:55:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:55:15,089 INFO L87 Difference]: Start difference. First operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:15,186 INFO L93 Difference]: Finished difference Result 1775 states and 4720 transitions. [2024-11-10 00:55:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:55:15,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:55:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:15,215 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 00:55:15,215 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:55:15,226 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-11-10 00:55:15,232 INFO L432 NwaCegarLoop]: 2326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:15,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:55:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:55:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.6992840095465396) internal successors, (2262), 839 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2262 transitions. [2024-11-10 00:55:15,319 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2262 transitions. Word has length 26 [2024-11-10 00:55:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:15,319 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2262 transitions. [2024-11-10 00:55:15,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2262 transitions. [2024-11-10 00:55:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:55:15,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:15,321 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] [2024-11-10 00:55:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:55:15,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:15,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1789896393, now seen corresponding path program 1 times [2024-11-10 00:55:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067039877] [2024-11-10 00:55:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:15,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067039877] [2024-11-10 00:55:15,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067039877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:15,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:15,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:55:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290790629] [2024-11-10 00:55:15,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:55:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:55:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:15,626 INFO L87 Difference]: Start difference. First operand 840 states and 2262 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:15,754 INFO L93 Difference]: Finished difference Result 891 states and 2339 transitions. [2024-11-10 00:55:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:55:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:55:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:15,760 INFO L225 Difference]: With dead ends: 891 [2024-11-10 00:55:15,760 INFO L226 Difference]: Without dead ends: 840 [2024-11-10 00:55:15,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:15,762 INFO L432 NwaCegarLoop]: 2260 mSDtfsCounter, 0 mSDsluCounter, 6744 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9004 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:15,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9004 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-10 00:55:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-10 00:55:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 2.662291169451074) internal successors, (2231), 839 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2231 transitions. [2024-11-10 00:55:15,857 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2231 transitions. Word has length 26 [2024-11-10 00:55:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 2231 transitions. [2024-11-10 00:55:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2231 transitions. [2024-11-10 00:55:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:55:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:15,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:55:15,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash -897461063, now seen corresponding path program 1 times [2024-11-10 00:55:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:15,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335725231] [2024-11-10 00:55:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335725231] [2024-11-10 00:55:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335725231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:55:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154701090] [2024-11-10 00:55:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:15,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:15,998 INFO L87 Difference]: Start difference. First operand 840 states and 2231 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:20,848 INFO L93 Difference]: Finished difference Result 2347 states and 6467 transitions. [2024-11-10 00:55:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:20,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:55:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:20,862 INFO L225 Difference]: With dead ends: 2347 [2024-11-10 00:55:20,862 INFO L226 Difference]: Without dead ends: 1592 [2024-11-10 00:55:20,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,868 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1557 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:20,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 191 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 00:55:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-10 00:55:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-10 00:55:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1590 states have (on average 2.6962264150943396) internal successors, (4287), 1591 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 4287 transitions. [2024-11-10 00:55:20,923 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 4287 transitions. Word has length 50 [2024-11-10 00:55:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 4287 transitions. [2024-11-10 00:55:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 4287 transitions. [2024-11-10 00:55:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:55:20,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:55:20,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1922131449, now seen corresponding path program 1 times [2024-11-10 00:55:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644674170] [2024-11-10 00:55:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644674170] [2024-11-10 00:55:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644674170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270393006] [2024-11-10 00:55:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:21,146 INFO L87 Difference]: Start difference. First operand 1592 states and 4287 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:21,399 INFO L93 Difference]: Finished difference Result 2062 states and 5017 transitions. [2024-11-10 00:55:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:55:21,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-10 00:55:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:21,410 INFO L225 Difference]: With dead ends: 2062 [2024-11-10 00:55:21,411 INFO L226 Difference]: Without dead ends: 2015 [2024-11-10 00:55:21,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:55:21,416 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 11419 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11419 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:21,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11419 Valid, 3435 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-10 00:55:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1636. [2024-11-10 00:55:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.6658506731946146) internal successors, (4356), 1635 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4356 transitions. [2024-11-10 00:55:21,463 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4356 transitions. Word has length 56 [2024-11-10 00:55:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 4356 transitions. [2024-11-10 00:55:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4356 transitions. [2024-11-10 00:55:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:55:21,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:21,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:55:21,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1673221541, now seen corresponding path program 1 times [2024-11-10 00:55:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921771796] [2024-11-10 00:55:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921771796] [2024-11-10 00:55:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921771796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569981154] [2024-11-10 00:55:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:21,836 INFO L87 Difference]: Start difference. First operand 1636 states and 4356 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,066 INFO L93 Difference]: Finished difference Result 1730 states and 4500 transitions. [2024-11-10 00:55:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-10 00:55:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,077 INFO L225 Difference]: With dead ends: 1730 [2024-11-10 00:55:22,078 INFO L226 Difference]: Without dead ends: 1639 [2024-11-10 00:55:22,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:55:22,082 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 6540 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6540 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6540 Valid, 2501 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-10 00:55:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1636. [2024-11-10 00:55:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.6652386780905752) internal successors, (4355), 1635 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4355 transitions. [2024-11-10 00:55:22,130 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4355 transitions. Word has length 58 [2024-11-10 00:55:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,130 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 4355 transitions. [2024-11-10 00:55:22,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4355 transitions. [2024-11-10 00:55:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:55:22,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:55:22,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1393558986, now seen corresponding path program 1 times [2024-11-10 00:55:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079556204] [2024-11-10 00:55:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079556204] [2024-11-10 00:55:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079556204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380270073] [2024-11-10 00:55:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,230 INFO L87 Difference]: Start difference. First operand 1636 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,274 INFO L93 Difference]: Finished difference Result 1806 states and 4617 transitions. [2024-11-10 00:55:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-10 00:55:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,283 INFO L225 Difference]: With dead ends: 1806 [2024-11-10 00:55:22,283 INFO L226 Difference]: Without dead ends: 1715 [2024-11-10 00:55:22,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,287 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2168 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2293 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-11-10 00:55:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1710. [2024-11-10 00:55:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1708 states have (on average 2.6153395784543325) internal successors, (4467), 1709 states have internal predecessors, (4467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4467 transitions. [2024-11-10 00:55:22,328 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4467 transitions. Word has length 59 [2024-11-10 00:55:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 4467 transitions. [2024-11-10 00:55:22,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4467 transitions. [2024-11-10 00:55:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:22,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:55:22,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash 691569053, now seen corresponding path program 1 times [2024-11-10 00:55:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814053221] [2024-11-10 00:55:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814053221] [2024-11-10 00:55:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814053221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289398791] [2024-11-10 00:55:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:22,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,388 INFO L87 Difference]: Start difference. First operand 1710 states and 4467 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,423 INFO L93 Difference]: Finished difference Result 2024 states and 4945 transitions. [2024-11-10 00:55:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:55:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,433 INFO L225 Difference]: With dead ends: 2024 [2024-11-10 00:55:22,433 INFO L226 Difference]: Without dead ends: 1859 [2024-11-10 00:55:22,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,435 INFO L432 NwaCegarLoop]: 2280 mSDtfsCounter, 2181 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-11-10 00:55:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1856. [2024-11-10 00:55:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1854 states have (on average 2.527508090614887) internal successors, (4686), 1855 states have internal predecessors, (4686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4686 transitions. [2024-11-10 00:55:22,478 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4686 transitions. Word has length 60 [2024-11-10 00:55:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,478 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 4686 transitions. [2024-11-10 00:55:22,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4686 transitions. [2024-11-10 00:55:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:22,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:55:22,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash -309840675, now seen corresponding path program 1 times [2024-11-10 00:55:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450902681] [2024-11-10 00:55:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450902681] [2024-11-10 00:55:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450902681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238674337] [2024-11-10 00:55:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:22,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,555 INFO L87 Difference]: Start difference. First operand 1856 states and 4686 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,599 INFO L93 Difference]: Finished difference Result 2446 states and 5574 transitions. [2024-11-10 00:55:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:55:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,609 INFO L225 Difference]: With dead ends: 2446 [2024-11-10 00:55:22,609 INFO L226 Difference]: Without dead ends: 2135 [2024-11-10 00:55:22,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,611 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 2179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 2360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-11-10 00:55:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2132. [2024-11-10 00:55:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2130 states have (on average 2.390610328638498) internal successors, (5092), 2131 states have internal predecessors, (5092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 5092 transitions. [2024-11-10 00:55:22,662 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 5092 transitions. Word has length 60 [2024-11-10 00:55:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,662 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 5092 transitions. [2024-11-10 00:55:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 5092 transitions. [2024-11-10 00:55:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:22,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:55:22,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -324290531, now seen corresponding path program 1 times [2024-11-10 00:55:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88571207] [2024-11-10 00:55:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88571207] [2024-11-10 00:55:22,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88571207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753302628] [2024-11-10 00:55:22,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:22,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,718 INFO L87 Difference]: Start difference. First operand 2132 states and 5092 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,819 INFO L93 Difference]: Finished difference Result 3242 states and 6736 transitions. [2024-11-10 00:55:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:22,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:55:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,832 INFO L225 Difference]: With dead ends: 3242 [2024-11-10 00:55:22,832 INFO L226 Difference]: Without dead ends: 2655 [2024-11-10 00:55:22,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,835 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2177 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-10 00:55:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2652. [2024-11-10 00:55:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2650 states have (on average 2.2037735849056603) internal successors, (5840), 2651 states have internal predecessors, (5840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 5840 transitions. [2024-11-10 00:55:22,906 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 5840 transitions. Word has length 60 [2024-11-10 00:55:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 5840 transitions. [2024-11-10 00:55:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 5840 transitions. [2024-11-10 00:55:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:22,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:55:22,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1767312221, now seen corresponding path program 1 times [2024-11-10 00:55:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779528626] [2024-11-10 00:55:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779528626] [2024-11-10 00:55:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779528626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768142600] [2024-11-10 00:55:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:22,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,964 INFO L87 Difference]: Start difference. First operand 2652 states and 5840 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:23,029 INFO L93 Difference]: Finished difference Result 4738 states and 8868 transitions. [2024-11-10 00:55:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:55:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:23,044 INFO L225 Difference]: With dead ends: 4738 [2024-11-10 00:55:23,044 INFO L226 Difference]: Without dead ends: 3631 [2024-11-10 00:55:23,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:23,052 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2175 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:23,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 2364 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-11-10 00:55:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3628. [2024-11-10 00:55:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 3626 states have (on average 1.987865416436845) internal successors, (7208), 3627 states have internal predecessors, (7208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 7208 transitions. [2024-11-10 00:55:23,159 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 7208 transitions. Word has length 60 [2024-11-10 00:55:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 3628 states and 7208 transitions. [2024-11-10 00:55:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 7208 transitions. [2024-11-10 00:55:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:23,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:23,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:55:23,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1243035166, now seen corresponding path program 1 times [2024-11-10 00:55:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103180828] [2024-11-10 00:55:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103180828] [2024-11-10 00:55:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103180828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:55:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105324368] [2024-11-10 00:55:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:23,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:55:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:55:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:55:23,426 INFO L87 Difference]: Start difference. First operand 3628 states and 7208 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:23,535 INFO L93 Difference]: Finished difference Result 3727 states and 7338 transitions. [2024-11-10 00:55:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:55:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-10 00:55:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:23,557 INFO L225 Difference]: With dead ends: 3727 [2024-11-10 00:55:23,557 INFO L226 Difference]: Without dead ends: 3724 [2024-11-10 00:55:23,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:55:23,564 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 0 mSDsluCounter, 13337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15562 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:23,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15562 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-11-10 00:55:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3724. [2024-11-10 00:55:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3722 states have (on average 1.9580870499731327) internal successors, (7288), 3723 states have internal predecessors, (7288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 7288 transitions. [2024-11-10 00:55:23,665 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 7288 transitions. Word has length 60 [2024-11-10 00:55:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 7288 transitions. [2024-11-10 00:55:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 7288 transitions. [2024-11-10 00:55:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:55:23,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:23,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:23,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:55:23,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:23,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1092605501, now seen corresponding path program 1 times [2024-11-10 00:55:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847097397] [2024-11-10 00:55:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847097397] [2024-11-10 00:55:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847097397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:23,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:23,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720977325] [2024-11-10 00:55:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:23,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:23,727 INFO L87 Difference]: Start difference. First operand 3724 states and 7288 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:23,793 INFO L93 Difference]: Finished difference Result 6038 states and 10593 transitions. [2024-11-10 00:55:23,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-10 00:55:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:23,803 INFO L225 Difference]: With dead ends: 6038 [2024-11-10 00:55:23,804 INFO L226 Difference]: Without dead ends: 4786 [2024-11-10 00:55:23,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:23,808 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 2180 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:23,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-10 00:55:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4783. [2024-11-10 00:55:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4781 states have (on average 1.829533570382765) internal successors, (8747), 4782 states have internal predecessors, (8747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 8747 transitions. [2024-11-10 00:55:23,916 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 8747 transitions. Word has length 62 [2024-11-10 00:55:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:23,916 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 8747 transitions. [2024-11-10 00:55:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 8747 transitions. [2024-11-10 00:55:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:23,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:23,919 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:23,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:55:23,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash 304318565, now seen corresponding path program 1 times [2024-11-10 00:55:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393018053] [2024-11-10 00:55:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:55:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393018053] [2024-11-10 00:55:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393018053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388224529] [2024-11-10 00:55:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:24,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:24,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:24,062 INFO L87 Difference]: Start difference. First operand 4783 states and 8747 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:24,506 INFO L93 Difference]: Finished difference Result 21665 states and 32343 transitions. [2024-11-10 00:55:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:24,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:24,544 INFO L225 Difference]: With dead ends: 21665 [2024-11-10 00:55:24,545 INFO L226 Difference]: Without dead ends: 18430 [2024-11-10 00:55:24,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:24,558 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 9080 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9080 SdHoareTripleChecker+Valid, 5032 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:24,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9080 Valid, 5032 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:55:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18430 states. [2024-11-10 00:55:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18430 to 8015. [2024-11-10 00:55:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.6506926244852116) internal successors, (13227), 8014 states have internal predecessors, (13227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 13227 transitions. [2024-11-10 00:55:24,829 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 13227 transitions. Word has length 81 [2024-11-10 00:55:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 8015 states and 13227 transitions. [2024-11-10 00:55:24,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 13227 transitions. [2024-11-10 00:55:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:24,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:24,832 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:55:24,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash -697091163, now seen corresponding path program 1 times [2024-11-10 00:55:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641197835] [2024-11-10 00:55:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:55:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641197835] [2024-11-10 00:55:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641197835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:25,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:25,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18440719] [2024-11-10 00:55:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:25,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:25,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:25,002 INFO L87 Difference]: Start difference. First operand 8015 states and 13227 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:25,579 INFO L93 Difference]: Finished difference Result 24897 states and 36823 transitions. [2024-11-10 00:55:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:25,623 INFO L225 Difference]: With dead ends: 24897 [2024-11-10 00:55:25,624 INFO L226 Difference]: Without dead ends: 21662 [2024-11-10 00:55:25,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:25,634 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 9102 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9102 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:25,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9102 Valid, 4973 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21662 states. [2024-11-10 00:55:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21662 to 12879. [2024-11-10 00:55:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12879 states, 12877 states have (on average 1.5465558748155626) internal successors, (19915), 12878 states have internal predecessors, (19915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 19915 transitions. [2024-11-10 00:55:26,151 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 19915 transitions. Word has length 81 [2024-11-10 00:55:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:26,152 INFO L471 AbstractCegarLoop]: Abstraction has 12879 states and 19915 transitions. [2024-11-10 00:55:26,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 19915 transitions. [2024-11-10 00:55:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:26,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:26,155 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:26,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:55:26,155 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -711541019, now seen corresponding path program 1 times [2024-11-10 00:55:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056284366] [2024-11-10 00:55:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:55:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:26,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056284366] [2024-11-10 00:55:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056284366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:26,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:26,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874243755] [2024-11-10 00:55:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:26,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:26,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:26,348 INFO L87 Difference]: Start difference. First operand 12879 states and 19915 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:26,920 INFO L93 Difference]: Finished difference Result 28129 states and 41303 transitions. [2024-11-10 00:55:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:26,973 INFO L225 Difference]: With dead ends: 28129 [2024-11-10 00:55:26,973 INFO L226 Difference]: Without dead ends: 24894 [2024-11-10 00:55:26,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:26,985 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 9150 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9150 SdHoareTripleChecker+Valid, 4933 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:26,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9150 Valid, 4933 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24894 states. [2024-11-10 00:55:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24894 to 16111. [2024-11-10 00:55:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16111 states, 16109 states have (on average 1.5143708485939538) internal successors, (24395), 16110 states have internal predecessors, (24395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16111 states to 16111 states and 24395 transitions. [2024-11-10 00:55:27,445 INFO L78 Accepts]: Start accepts. Automaton has 16111 states and 24395 transitions. Word has length 81 [2024-11-10 00:55:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:27,445 INFO L471 AbstractCegarLoop]: Abstraction has 16111 states and 24395 transitions. [2024-11-10 00:55:27,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 16111 states and 24395 transitions. [2024-11-10 00:55:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:27,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:27,448 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:27,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:55:27,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1380061733, now seen corresponding path program 1 times [2024-11-10 00:55:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407570584] [2024-11-10 00:55:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:55:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407570584] [2024-11-10 00:55:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407570584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755318245] [2024-11-10 00:55:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:27,626 INFO L87 Difference]: Start difference. First operand 16111 states and 24395 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:28,241 INFO L93 Difference]: Finished difference Result 31361 states and 45783 transitions. [2024-11-10 00:55:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:28,289 INFO L225 Difference]: With dead ends: 31361 [2024-11-10 00:55:28,289 INFO L226 Difference]: Without dead ends: 28126 [2024-11-10 00:55:28,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:28,302 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 9095 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9095 SdHoareTripleChecker+Valid, 4991 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:28,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9095 Valid, 4991 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28126 states. [2024-11-10 00:55:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28126 to 19343. [2024-11-10 00:55:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19343 states, 19341 states have (on average 1.492942453854506) internal successors, (28875), 19342 states have internal predecessors, (28875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19343 states to 19343 states and 28875 transitions. [2024-11-10 00:55:28,804 INFO L78 Accepts]: Start accepts. Automaton has 19343 states and 28875 transitions. Word has length 81 [2024-11-10 00:55:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:28,805 INFO L471 AbstractCegarLoop]: Abstraction has 19343 states and 28875 transitions. [2024-11-10 00:55:28,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19343 states and 28875 transitions. [2024-11-10 00:55:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:28,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:28,810 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:28,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:55:28,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1613241913, now seen corresponding path program 1 times [2024-11-10 00:55:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859583847] [2024-11-10 00:55:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859583847] [2024-11-10 00:55:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859583847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012450999] [2024-11-10 00:55:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:28,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:28,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:28,917 INFO L87 Difference]: Start difference. First operand 19343 states and 28875 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:29,143 INFO L93 Difference]: Finished difference Result 32043 states and 46678 transitions. [2024-11-10 00:55:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:29,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:55:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:29,175 INFO L225 Difference]: With dead ends: 32043 [2024-11-10 00:55:29,176 INFO L226 Difference]: Without dead ends: 14248 [2024-11-10 00:55:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:29,197 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 51 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 4489 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14248 states. [2024-11-10 00:55:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14248 to 14245. [2024-11-10 00:55:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14245 states, 14243 states have (on average 1.5334550305413186) internal successors, (21841), 14244 states have internal predecessors, (21841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14245 states to 14245 states and 21841 transitions. [2024-11-10 00:55:29,655 INFO L78 Accepts]: Start accepts. Automaton has 14245 states and 21841 transitions. Word has length 83 [2024-11-10 00:55:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 14245 states and 21841 transitions. [2024-11-10 00:55:29,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14245 states and 21841 transitions. [2024-11-10 00:55:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:29,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:29,658 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:55:29,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1687926011, now seen corresponding path program 1 times [2024-11-10 00:55:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089665806] [2024-11-10 00:55:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:55:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089665806] [2024-11-10 00:55:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089665806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924867280] [2024-11-10 00:55:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:29,819 INFO L87 Difference]: Start difference. First operand 14245 states and 21841 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:30,302 INFO L93 Difference]: Finished difference Result 25783 states and 38013 transitions. [2024-11-10 00:55:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 83 [2024-11-10 00:55:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:30,338 INFO L225 Difference]: With dead ends: 25783 [2024-11-10 00:55:30,339 INFO L226 Difference]: Without dead ends: 23476 [2024-11-10 00:55:30,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:30,353 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9089 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9089 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:30,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9089 Valid, 5146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2024-11-10 00:55:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 16549. [2024-11-10 00:55:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16549 states, 16547 states have (on average 1.5133256783707016) internal successors, (25041), 16548 states have internal predecessors, (25041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16549 states to 16549 states and 25041 transitions. [2024-11-10 00:55:30,931 INFO L78 Accepts]: Start accepts. Automaton has 16549 states and 25041 transitions. Word has length 83 [2024-11-10 00:55:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 16549 states and 25041 transitions. [2024-11-10 00:55:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16549 states and 25041 transitions. [2024-11-10 00:55:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:55:30,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:30,935 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:30,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:55:30,936 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:30,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash -604865433, now seen corresponding path program 1 times [2024-11-10 00:55:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497849194] [2024-11-10 00:55:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:31,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497849194] [2024-11-10 00:55:31,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497849194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:31,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:31,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:31,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359634668] [2024-11-10 00:55:31,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:31,080 INFO L87 Difference]: Start difference. First operand 16549 states and 25041 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:31,327 INFO L93 Difference]: Finished difference Result 24043 states and 35445 transitions. [2024-11-10 00:55:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:55:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:31,345 INFO L225 Difference]: With dead ends: 24043 [2024-11-10 00:55:31,345 INFO L226 Difference]: Without dead ends: 9064 [2024-11-10 00:55:31,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:31,363 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 44 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:31,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4474 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2024-11-10 00:55:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9061. [2024-11-10 00:55:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9061 states, 9059 states have (on average 1.6047025057953417) internal successors, (14537), 9060 states have internal predecessors, (14537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9061 states to 9061 states and 14537 transitions. [2024-11-10 00:55:31,626 INFO L78 Accepts]: Start accepts. Automaton has 9061 states and 14537 transitions. Word has length 85 [2024-11-10 00:55:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 9061 states and 14537 transitions. [2024-11-10 00:55:31,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9061 states and 14537 transitions. [2024-11-10 00:55:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:55:31,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:31,630 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:55:31,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 884605097, now seen corresponding path program 1 times [2024-11-10 00:55:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664548361] [2024-11-10 00:55:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664548361] [2024-11-10 00:55:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664548361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5150126] [2024-11-10 00:55:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:31,766 INFO L87 Difference]: Start difference. First operand 9061 states and 14537 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:31,906 INFO L93 Difference]: Finished difference Result 12811 states and 19689 transitions. [2024-11-10 00:55:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 00:55:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:31,917 INFO L225 Difference]: With dead ends: 12811 [2024-11-10 00:55:31,918 INFO L226 Difference]: Without dead ends: 5320 [2024-11-10 00:55:31,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:31,929 INFO L432 NwaCegarLoop]: 2259 mSDtfsCounter, 39 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:31,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4459 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-11-10 00:55:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5317. [2024-11-10 00:55:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5315 states have (on average 1.7567262464722484) internal successors, (9337), 5316 states have internal predecessors, (9337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 9337 transitions. [2024-11-10 00:55:32,107 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 9337 transitions. Word has length 87 [2024-11-10 00:55:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:32,107 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 9337 transitions. [2024-11-10 00:55:32,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 9337 transitions. [2024-11-10 00:55:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:55:32,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:32,111 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:32,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:55:32,111 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2145385200, now seen corresponding path program 1 times [2024-11-10 00:55:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:32,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990611577] [2024-11-10 00:55:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990611577] [2024-11-10 00:55:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990611577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253900540] [2024-11-10 00:55:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:32,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:32,252 INFO L87 Difference]: Start difference. First operand 5317 states and 9337 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:32,337 INFO L93 Difference]: Finished difference Result 7195 states and 11889 transitions. [2024-11-10 00:55:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:55:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:32,345 INFO L225 Difference]: With dead ends: 7195 [2024-11-10 00:55:32,345 INFO L226 Difference]: Without dead ends: 3448 [2024-11-10 00:55:32,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:32,350 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 36 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:32,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4444 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2024-11-10 00:55:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3445. [2024-11-10 00:55:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3443 states have (on average 1.9642753412721463) internal successors, (6763), 3444 states have internal predecessors, (6763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6763 transitions. [2024-11-10 00:55:32,431 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6763 transitions. Word has length 89 [2024-11-10 00:55:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:32,432 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 6763 transitions. [2024-11-10 00:55:32,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6763 transitions. [2024-11-10 00:55:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:32,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:32,433 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:55:32,434 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2015095447, now seen corresponding path program 1 times [2024-11-10 00:55:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365169961] [2024-11-10 00:55:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365169961] [2024-11-10 00:55:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365169961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:32,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55871013] [2024-11-10 00:55:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:32,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:32,542 INFO L87 Difference]: Start difference. First operand 3445 states and 6763 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:32,588 INFO L93 Difference]: Finished difference Result 4387 states and 8028 transitions. [2024-11-10 00:55:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:32,594 INFO L225 Difference]: With dead ends: 4387 [2024-11-10 00:55:32,594 INFO L226 Difference]: Without dead ends: 2512 [2024-11-10 00:55:32,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:32,596 INFO L432 NwaCegarLoop]: 2245 mSDtfsCounter, 33 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:32,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4429 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2024-11-10 00:55:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2509. [2024-11-10 00:55:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 2.1894694854407657) internal successors, (5489), 2508 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 5489 transitions. [2024-11-10 00:55:32,646 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 5489 transitions. Word has length 91 [2024-11-10 00:55:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:32,647 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 5489 transitions. [2024-11-10 00:55:32,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 5489 transitions. [2024-11-10 00:55:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:32,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:32,648 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:32,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:55:32,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:32,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -196861634, now seen corresponding path program 1 times [2024-11-10 00:55:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209767585] [2024-11-10 00:55:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209767585] [2024-11-10 00:55:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209767585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445464835] [2024-11-10 00:55:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:33,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:33,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:33,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:55:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:33,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:55:33,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:33,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445464835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:35,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-10 00:55:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357725078] [2024-11-10 00:55:35,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 00:55:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 00:55:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:55:35,184 INFO L87 Difference]: Start difference. First operand 2509 states and 5489 transitions. Second operand has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:36,623 INFO L93 Difference]: Finished difference Result 6534 states and 10859 transitions. [2024-11-10 00:55:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:55:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-10 00:55:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:36,632 INFO L225 Difference]: With dead ends: 6534 [2024-11-10 00:55:36,633 INFO L226 Difference]: Without dead ends: 5595 [2024-11-10 00:55:36,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:55:36,637 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 27344 mSDsluCounter, 11566 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27344 SdHoareTripleChecker+Valid, 13754 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:36,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27344 Valid, 13754 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:55:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2024-11-10 00:55:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5525. [2024-11-10 00:55:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 5523 states have (on average 1.6999818938982436) internal successors, (9389), 5524 states have internal predecessors, (9389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 9389 transitions. [2024-11-10 00:55:36,768 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 9389 transitions. Word has length 93 [2024-11-10 00:55:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 5525 states and 9389 transitions. [2024-11-10 00:55:36,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 9389 transitions. [2024-11-10 00:55:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:36,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:36,771 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:36,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:55:36,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 00:55:36,976 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:36,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1391570274, now seen corresponding path program 1 times [2024-11-10 00:55:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:36,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885450711] [2024-11-10 00:55:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885450711] [2024-11-10 00:55:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885450711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120662305] [2024-11-10 00:55:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:37,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:37,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:55:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:37,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:55:37,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:38,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120662305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:39,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-11-10 00:55:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459998021] [2024-11-10 00:55:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:39,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 00:55:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 00:55:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-11-10 00:55:39,057 INFO L87 Difference]: Start difference. First operand 5525 states and 9389 transitions. Second operand has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:39,758 INFO L93 Difference]: Finished difference Result 13750 states and 20159 transitions. [2024-11-10 00:55:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:55:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 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 93 [2024-11-10 00:55:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:39,771 INFO L225 Difference]: With dead ends: 13750 [2024-11-10 00:55:39,771 INFO L226 Difference]: Without dead ends: 9795 [2024-11-10 00:55:39,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 00:55:39,779 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 19949 mSDsluCounter, 9151 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19949 SdHoareTripleChecker+Valid, 11351 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:39,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19949 Valid, 11351 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:55:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2024-11-10 00:55:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9685. [2024-11-10 00:55:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9685 states, 9683 states have (on average 1.5174016317257049) internal successors, (14693), 9684 states have internal predecessors, (14693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 14693 transitions. [2024-11-10 00:55:39,970 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 14693 transitions. Word has length 93 [2024-11-10 00:55:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:39,970 INFO L471 AbstractCegarLoop]: Abstraction has 9685 states and 14693 transitions. [2024-11-10 00:55:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 26 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 14693 transitions. [2024-11-10 00:55:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:55:39,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:39,973 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:39,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:55:40,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:55:40,174 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:40,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1431918908, now seen corresponding path program 1 times [2024-11-10 00:55:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693869081] [2024-11-10 00:55:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693869081] [2024-11-10 00:55:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693869081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313063632] [2024-11-10 00:55:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:40,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:40,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:55:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:40,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 00:55:40,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:42,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313063632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:43,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2024-11-10 00:55:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796269562] [2024-11-10 00:55:43,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:43,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:55:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:55:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:55:43,254 INFO L87 Difference]: Start difference. First operand 9685 states and 14693 transitions. Second operand has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:48,440 INFO L93 Difference]: Finished difference Result 60598 states and 80499 transitions. [2024-11-10 00:55:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-10 00:55:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 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 94 [2024-11-10 00:55:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:48,506 INFO L225 Difference]: With dead ends: 60598 [2024-11-10 00:55:48,507 INFO L226 Difference]: Without dead ends: 52483 [2024-11-10 00:55:48,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1586, Invalid=6424, Unknown=0, NotChecked=0, Total=8010 [2024-11-10 00:55:48,529 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 33099 mSDsluCounter, 14227 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33099 SdHoareTripleChecker+Valid, 16462 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:48,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33099 Valid, 16462 Invalid, 1396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:55:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52483 states. [2024-11-10 00:55:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52483 to 52037. [2024-11-10 00:55:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52037 states, 52035 states have (on average 1.315134044393197) internal successors, (68433), 52036 states have internal predecessors, (68433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52037 states to 52037 states and 68433 transitions. [2024-11-10 00:55:49,867 INFO L78 Accepts]: Start accepts. Automaton has 52037 states and 68433 transitions. Word has length 94 [2024-11-10 00:55:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:49,868 INFO L471 AbstractCegarLoop]: Abstraction has 52037 states and 68433 transitions. [2024-11-10 00:55:49,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.466666666666667) internal successors, (254), 29 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52037 states and 68433 transitions. [2024-11-10 00:55:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:55:49,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:49,875 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:55:49,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:55:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:50,076 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:50,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash -529417021, now seen corresponding path program 1 times [2024-11-10 00:55:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:50,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227334558] [2024-11-10 00:55:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227334558] [2024-11-10 00:55:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227334558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933970868] [2024-11-10 00:55:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:51,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:51,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:55:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:51,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 00:55:51,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:53,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933970868] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:55,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 21] total 49 [2024-11-10 00:55:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085147893] [2024-11-10 00:55:55,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 00:55:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 00:55:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 00:55:55,912 INFO L87 Difference]: Start difference. First operand 52037 states and 68433 transitions. Second operand has 49 states, 49 states have (on average 5.285714285714286) internal successors, (259), 49 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)