./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 65aa760b31ea5e49c4bb5ba7f2fb3b1e4951bce7653ba384d4ba0c02ae0acea3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:56:35,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:56:35,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:56:35,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:56:35,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:56:35,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:56:35,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:56:35,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:56:35,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:56:35,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:56:35,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:56:35,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:56:35,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:56:35,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:56:35,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:56:35,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:56:35,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:56:35,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:56:35,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:56:35,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:56:35,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:56:35,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:56:35,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:56:35,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:56:35,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:56:35,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:56:35,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:56:35,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:56:35,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:56:35,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:56:35,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:56:35,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:56:35,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:56:35,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:56:35,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:56:35,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:56:35,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:56:35,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:56:35,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:56:35,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:56:35,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:56:35,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:56:35,291 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-clean/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-clean/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 -> 65aa760b31ea5e49c4bb5ba7f2fb3b1e4951bce7653ba384d4ba0c02ae0acea3 [2024-10-11 04:56:35,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:56:35,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:56:35,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:56:35,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:56:35,572 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:56:35,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-11 04:56:37,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:56:37,553 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:56:37,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-11 04:56:37,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e367fee9/b5fc1cba8f6c41be8a708e679f417e6e/FLAGd5c76e1c7 [2024-10-11 04:56:37,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e367fee9/b5fc1cba8f6c41be8a708e679f417e6e [2024-10-11 04:56:37,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:56:37,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:56:37,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:56:37,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:56:37,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:56:37,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:56:37" (1/1) ... [2024-10-11 04:56:37,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d51622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:37, skipping insertion in model container [2024-10-11 04:56:37,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:56:37" (1/1) ... [2024-10-11 04:56:37,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:56:38,175 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[20528,20541] [2024-10-11 04:56:38,224 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[27464,27477] [2024-10-11 04:56:38,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:56:38,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:56:38,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[20528,20541] [2024-10-11 04:56:38,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[27464,27477] [2024-10-11 04:56:39,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:56:39,187 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:56:39,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39 WrapperNode [2024-10-11 04:56:39,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:56:39,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:56:39,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:56:39,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:56:39,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,476 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5217 [2024-10-11 04:56:39,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:56:39,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:56:39,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:56:39,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:56:39,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,714 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:56:39,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:39,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:40,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:56:40,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:56:40,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:56:40,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:56:40,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (1/1) ... [2024-10-11 04:56:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:56:40,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:56:40,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:56:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:56:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:56:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:56:40,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:56:40,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:56:40,229 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:56:40,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:56:44,319 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-11 04:56:44,320 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:56:44,391 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:56:44,394 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:56:44,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:56:44 BoogieIcfgContainer [2024-10-11 04:56:44,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:56:44,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:56:44,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:56:44,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:56:44,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:56:37" (1/3) ... [2024-10-11 04:56:44,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132943d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:56:44, skipping insertion in model container [2024-10-11 04:56:44,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:56:39" (2/3) ... [2024-10-11 04:56:44,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132943d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:56:44, skipping insertion in model container [2024-10-11 04:56:44,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:56:44" (3/3) ... [2024-10-11 04:56:44,408 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-10-11 04:56:44,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:56:44,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:56:44,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:56:44,517 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;@e3d9f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:56:44,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:56:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 865 states, 862 states have (on average 1.9721577726218098) internal successors, (1700), 864 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 04:56:44,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:44,532 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] [2024-10-11 04:56:44,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -58125809, now seen corresponding path program 1 times [2024-10-11 04:56:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856332846] [2024-10-11 04:56:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856332846] [2024-10-11 04:56:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856332846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:44,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:56:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694985726] [2024-10-11 04:56:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:56:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:56:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:56:44,764 INFO L87 Difference]: Start difference. First operand has 865 states, 862 states have (on average 1.9721577726218098) internal successors, (1700), 864 states have internal predecessors, (1700), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:44,840 INFO L93 Difference]: Finished difference Result 1675 states and 3293 transitions. [2024-10-11 04:56:44,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:56:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 04:56:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:44,856 INFO L225 Difference]: With dead ends: 1675 [2024-10-11 04:56:44,857 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 04:56:44,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:56:44,864 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:44,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1628 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 04:56:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-10-11 04:56:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.8963911525029105) internal successors, (1629), 860 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1629 transitions. [2024-10-11 04:56:44,931 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1629 transitions. Word has length 25 [2024-10-11 04:56:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:44,931 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1629 transitions. [2024-10-11 04:56:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1629 transitions. [2024-10-11 04:56:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 04:56:44,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:44,933 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] [2024-10-11 04:56:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:56:44,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 364576017, now seen corresponding path program 1 times [2024-10-11 04:56:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857104382] [2024-10-11 04:56:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857104382] [2024-10-11 04:56:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857104382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:56:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259889742] [2024-10-11 04:56:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:45,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:56:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:56:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:45,144 INFO L87 Difference]: Start difference. First operand 861 states and 1629 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:45,261 INFO L93 Difference]: Finished difference Result 917 states and 1718 transitions. [2024-10-11 04:56:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:56:45,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 04:56:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:45,267 INFO L225 Difference]: With dead ends: 917 [2024-10-11 04:56:45,267 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 04:56:45,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:45,269 INFO L432 NwaCegarLoop]: 1626 mSDtfsCounter, 0 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:45,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4824 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 04:56:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-10-11 04:56:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 1.838183934807916) internal successors, (1579), 860 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1579 transitions. [2024-10-11 04:56:45,311 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1579 transitions. Word has length 25 [2024-10-11 04:56:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1579 transitions. [2024-10-11 04:56:45,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1579 transitions. [2024-10-11 04:56:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 04:56:45,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:45,316 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-10-11 04:56:45,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:56:45,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2121093177, now seen corresponding path program 1 times [2024-10-11 04:56:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101053926] [2024-10-11 04:56:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:45,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101053926] [2024-10-11 04:56:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101053926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:45,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607992061] [2024-10-11 04:56:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:56:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:56:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:45,595 INFO L87 Difference]: Start difference. First operand 861 states and 1579 transitions. Second operand has 4 states, 4 states have (on average 14.75) 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-10-11 04:56:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:52,223 INFO L93 Difference]: Finished difference Result 3116 states and 5888 transitions. [2024-10-11 04:56:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:56:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) 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-10-11 04:56:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:52,237 INFO L225 Difference]: With dead ends: 3116 [2024-10-11 04:56:52,237 INFO L226 Difference]: Without dead ends: 2363 [2024-10-11 04:56:52,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:56:52,240 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2462 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:52,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 848 Invalid, 6621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-11 04:56:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2024-10-11 04:56:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2024-10-11 04:56:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2361 states have (on average 1.5692503176620076) internal successors, (3705), 2362 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3705 transitions. [2024-10-11 04:56:52,290 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3705 transitions. Word has length 59 [2024-10-11 04:56:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:52,291 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3705 transitions. [2024-10-11 04:56:52,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) 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-10-11 04:56:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3705 transitions. [2024-10-11 04:56:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 04:56:52,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:52,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:52,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:56:52,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:52,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1115950856, now seen corresponding path program 1 times [2024-10-11 04:56:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:52,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246652441] [2024-10-11 04:56:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246652441] [2024-10-11 04:56:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246652441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:52,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:52,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526528995] [2024-10-11 04:56:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:52,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:52,618 INFO L87 Difference]: Start difference. First operand 2363 states and 3705 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:53,127 INFO L93 Difference]: Finished difference Result 3105 states and 4909 transitions. [2024-10-11 04:56:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:56:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-11 04:56:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:53,139 INFO L225 Difference]: With dead ends: 3105 [2024-10-11 04:56:53,139 INFO L226 Difference]: Without dead ends: 3052 [2024-10-11 04:56:53,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-11 04:56:53,142 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 11475 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11475 SdHoareTripleChecker+Valid, 5036 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:53,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11475 Valid, 5036 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:56:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2024-10-11 04:56:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2414. [2024-10-11 04:56:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.570480928689884) internal successors, (3788), 2413 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3788 transitions. [2024-10-11 04:56:53,187 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3788 transitions. Word has length 74 [2024-10-11 04:56:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:53,189 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3788 transitions. [2024-10-11 04:56:53,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3788 transitions. [2024-10-11 04:56:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:56:53,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:53,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:56:53,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:53,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1436654440, now seen corresponding path program 1 times [2024-10-11 04:56:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481176657] [2024-10-11 04:56:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481176657] [2024-10-11 04:56:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481176657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:53,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:53,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511782760] [2024-10-11 04:56:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:53,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:53,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:53,358 INFO L87 Difference]: Start difference. First operand 2414 states and 3788 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:53,406 INFO L93 Difference]: Finished difference Result 2611 states and 4107 transitions. [2024-10-11 04:56:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 04:56:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:53,419 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 04:56:53,419 INFO L226 Difference]: Without dead ends: 2507 [2024-10-11 04:56:53,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:53,422 INFO L432 NwaCegarLoop]: 1574 mSDtfsCounter, 1496 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:53,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1654 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2024-10-11 04:56:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2024-10-11 04:56:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.5717139432680782) internal successors, (3934), 2504 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3934 transitions. [2024-10-11 04:56:53,490 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3934 transitions. Word has length 76 [2024-10-11 04:56:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:53,491 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3934 transitions. [2024-10-11 04:56:53,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3934 transitions. [2024-10-11 04:56:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:56:53,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:53,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:53,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:56:53,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:53,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1434509488, now seen corresponding path program 1 times [2024-10-11 04:56:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:53,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653041830] [2024-10-11 04:56:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653041830] [2024-10-11 04:56:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653041830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274894714] [2024-10-11 04:56:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:54,007 INFO L87 Difference]: Start difference. First operand 2505 states and 3934 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:54,454 INFO L93 Difference]: Finished difference Result 2702 states and 4250 transitions. [2024-10-11 04:56:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:56:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-11 04:56:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:54,468 INFO L225 Difference]: With dead ends: 2702 [2024-10-11 04:56:54,468 INFO L226 Difference]: Without dead ends: 2507 [2024-10-11 04:56:54,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 04:56:54,474 INFO L432 NwaCegarLoop]: 1567 mSDtfsCounter, 9042 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9042 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:54,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9042 Valid, 2059 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:56:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2024-10-11 04:56:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2024-10-11 04:56:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2503 states have (on average 1.570914902117459) internal successors, (3932), 2504 states have internal predecessors, (3932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3932 transitions. [2024-10-11 04:56:54,533 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3932 transitions. Word has length 76 [2024-10-11 04:56:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:54,534 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3932 transitions. [2024-10-11 04:56:54,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3932 transitions. [2024-10-11 04:56:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 04:56:54,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:54,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:54,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:56:54,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:54,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1648504521, now seen corresponding path program 1 times [2024-10-11 04:56:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971623975] [2024-10-11 04:56:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971623975] [2024-10-11 04:56:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971623975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:56:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676612778] [2024-10-11 04:56:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:56:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:56:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:54,696 INFO L87 Difference]: Start difference. First operand 2505 states and 3932 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-10-11 04:56:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:54,739 INFO L93 Difference]: Finished difference Result 2511 states and 3939 transitions. [2024-10-11 04:56:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:56:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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 77 [2024-10-11 04:56:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:54,749 INFO L225 Difference]: With dead ends: 2511 [2024-10-11 04:56:54,749 INFO L226 Difference]: Without dead ends: 2509 [2024-10-11 04:56:54,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:56:54,751 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4717 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:54,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4717 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2024-10-11 04:56:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2509. [2024-10-11 04:56:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2507 states have (on average 1.5696051057040288) internal successors, (3935), 2508 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3935 transitions. [2024-10-11 04:56:54,809 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3935 transitions. Word has length 77 [2024-10-11 04:56:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:54,810 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3935 transitions. [2024-10-11 04:56:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-10-11 04:56:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3935 transitions. [2024-10-11 04:56:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:54,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:54,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:56:54,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -981819824, now seen corresponding path program 1 times [2024-10-11 04:56:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032449555] [2024-10-11 04:56:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032449555] [2024-10-11 04:56:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032449555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381218478] [2024-10-11 04:56:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:54,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:54,875 INFO L87 Difference]: Start difference. First operand 2509 states and 3935 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:54,912 INFO L93 Difference]: Finished difference Result 2719 states and 4268 transitions. [2024-10-11 04:56:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:54,921 INFO L225 Difference]: With dead ends: 2719 [2024-10-11 04:56:54,921 INFO L226 Difference]: Without dead ends: 2611 [2024-10-11 04:56:54,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:54,923 INFO L432 NwaCegarLoop]: 1646 mSDtfsCounter, 1514 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:54,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1732 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2024-10-11 04:56:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2609. [2024-10-11 04:56:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2607 states have (on average 1.5696202531645569) internal successors, (4092), 2608 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4092 transitions. [2024-10-11 04:56:54,974 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4092 transitions. Word has length 78 [2024-10-11 04:56:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4092 transitions. [2024-10-11 04:56:54,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4092 transitions. [2024-10-11 04:56:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:54,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:54,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:54,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:56:54,976 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash -226435760, now seen corresponding path program 1 times [2024-10-11 04:56:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225860663] [2024-10-11 04:56:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225860663] [2024-10-11 04:56:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225860663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396210661] [2024-10-11 04:56:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,039 INFO L87 Difference]: Start difference. First operand 2609 states and 4092 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:55,085 INFO L93 Difference]: Finished difference Result 3179 states and 4992 transitions. [2024-10-11 04:56:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:55,095 INFO L225 Difference]: With dead ends: 3179 [2024-10-11 04:56:55,096 INFO L226 Difference]: Without dead ends: 2882 [2024-10-11 04:56:55,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,098 INFO L432 NwaCegarLoop]: 1648 mSDtfsCounter, 1512 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:55,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2024-10-11 04:56:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2880. [2024-10-11 04:56:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 1.5684503127171647) internal successors, (4514), 2879 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4514 transitions. [2024-10-11 04:56:55,169 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4514 transitions. Word has length 78 [2024-10-11 04:56:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4514 transitions. [2024-10-11 04:56:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4514 transitions. [2024-10-11 04:56:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:55,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:55,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:55,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:56:55,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:55,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -636822448, now seen corresponding path program 1 times [2024-10-11 04:56:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:55,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674992694] [2024-10-11 04:56:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674992694] [2024-10-11 04:56:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674992694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981869567] [2024-10-11 04:56:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,238 INFO L87 Difference]: Start difference. First operand 2880 states and 4514 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:55,305 INFO L93 Difference]: Finished difference Result 3968 states and 6216 transitions. [2024-10-11 04:56:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:55,318 INFO L225 Difference]: With dead ends: 3968 [2024-10-11 04:56:55,318 INFO L226 Difference]: Without dead ends: 3400 [2024-10-11 04:56:55,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,321 INFO L432 NwaCegarLoop]: 1646 mSDtfsCounter, 1510 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:55,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1740 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2024-10-11 04:56:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3398. [2024-10-11 04:56:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3396 states have (on average 1.5636042402826855) internal successors, (5310), 3397 states have internal predecessors, (5310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 5310 transitions. [2024-10-11 04:56:55,523 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 5310 transitions. Word has length 78 [2024-10-11 04:56:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:55,523 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 5310 transitions. [2024-10-11 04:56:55,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 5310 transitions. [2024-10-11 04:56:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:55,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:55,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:55,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:56:55,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:55,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash -905405616, now seen corresponding path program 1 times [2024-10-11 04:56:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:55,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20652541] [2024-10-11 04:56:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20652541] [2024-10-11 04:56:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20652541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459849754] [2024-10-11 04:56:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,594 INFO L87 Difference]: Start difference. First operand 3398 states and 5310 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:55,671 INFO L93 Difference]: Finished difference Result 5474 states and 8520 transitions. [2024-10-11 04:56:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:55,685 INFO L225 Difference]: With dead ends: 5474 [2024-10-11 04:56:55,688 INFO L226 Difference]: Without dead ends: 4388 [2024-10-11 04:56:55,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,691 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 1508 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:55,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1742 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2024-10-11 04:56:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4386. [2024-10-11 04:56:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4384 states have (on average 1.552463503649635) internal successors, (6806), 4385 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 6806 transitions. [2024-10-11 04:56:55,800 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 6806 transitions. Word has length 78 [2024-10-11 04:56:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:55,801 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 6806 transitions. [2024-10-11 04:56:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 6806 transitions. [2024-10-11 04:56:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:55,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:55,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:55,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:56:55,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1491117744, now seen corresponding path program 1 times [2024-10-11 04:56:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315195340] [2024-10-11 04:56:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315195340] [2024-10-11 04:56:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315195340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685744423] [2024-10-11 04:56:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:55,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:55,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:55,885 INFO L87 Difference]: Start difference. First operand 4386 states and 6806 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:55,984 INFO L93 Difference]: Finished difference Result 8342 states and 12840 transitions. [2024-10-11 04:56:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:55,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:56,001 INFO L225 Difference]: With dead ends: 8342 [2024-10-11 04:56:56,001 INFO L226 Difference]: Without dead ends: 6268 [2024-10-11 04:56:56,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:56,006 INFO L432 NwaCegarLoop]: 1632 mSDtfsCounter, 1504 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:56,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2024-10-11 04:56:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6266. [2024-10-11 04:56:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6264 states have (on average 1.5335249042145593) internal successors, (9606), 6265 states have internal predecessors, (9606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 9606 transitions. [2024-10-11 04:56:56,154 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 9606 transitions. Word has length 78 [2024-10-11 04:56:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:56,154 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 9606 transitions. [2024-10-11 04:56:56,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 9606 transitions. [2024-10-11 04:56:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:56,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:56,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:56,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:56:56,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash -602384304, now seen corresponding path program 1 times [2024-10-11 04:56:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300843263] [2024-10-11 04:56:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300843263] [2024-10-11 04:56:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300843263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355238383] [2024-10-11 04:56:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:56,224 INFO L87 Difference]: Start difference. First operand 6266 states and 9606 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:56,392 INFO L93 Difference]: Finished difference Result 13790 states and 20904 transitions. [2024-10-11 04:56:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:56,407 INFO L225 Difference]: With dead ends: 13790 [2024-10-11 04:56:56,407 INFO L226 Difference]: Without dead ends: 9836 [2024-10-11 04:56:56,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:56,415 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 1502 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:56,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1740 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2024-10-11 04:56:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 9834. [2024-10-11 04:56:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9832 states have (on average 1.507526444263629) internal successors, (14822), 9833 states have internal predecessors, (14822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 14822 transitions. [2024-10-11 04:56:56,924 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 14822 transitions. Word has length 78 [2024-10-11 04:56:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:56,925 INFO L471 AbstractCegarLoop]: Abstraction has 9834 states and 14822 transitions. [2024-10-11 04:56:56,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 14822 transitions. [2024-10-11 04:56:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:56:56,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:56,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:56,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:56:56,929 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:56,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash -865461680, now seen corresponding path program 1 times [2024-10-11 04:56:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550159223] [2024-10-11 04:56:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:56:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550159223] [2024-10-11 04:56:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550159223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:56:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946449573] [2024-10-11 04:56:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:56:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:56:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:57,012 INFO L87 Difference]: Start difference. First operand 9834 states and 14822 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:56:57,497 INFO L93 Difference]: Finished difference Result 24110 states and 35880 transitions. [2024-10-11 04:56:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:56:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-11 04:56:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:56:57,535 INFO L225 Difference]: With dead ends: 24110 [2024-10-11 04:56:57,535 INFO L226 Difference]: Without dead ends: 16588 [2024-10-11 04:56:57,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:56:57,552 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1506 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:56:57,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1744 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:56:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16588 states. [2024-10-11 04:56:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16588 to 16586. [2024-10-11 04:56:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16586 states, 16584 states have (on average 1.4764833574529668) internal successors, (24486), 16585 states have internal predecessors, (24486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 24486 transitions. [2024-10-11 04:56:58,320 INFO L78 Accepts]: Start accepts. Automaton has 16586 states and 24486 transitions. Word has length 78 [2024-10-11 04:56:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:56:58,320 INFO L471 AbstractCegarLoop]: Abstraction has 16586 states and 24486 transitions. [2024-10-11 04:56:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:56:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16586 states and 24486 transitions. [2024-10-11 04:56:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:56:58,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:56:58,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:56:58,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:56:58,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:56:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:56:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1758605507, now seen corresponding path program 1 times [2024-10-11 04:56:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:56:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339061029] [2024-10-11 04:56:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:56:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:56:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:56:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:56:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:56:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339061029] [2024-10-11 04:56:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339061029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:56:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:56:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:56:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882165126] [2024-10-11 04:56:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:56:58,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:56:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:56:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:56:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:56:58,613 INFO L87 Difference]: Start difference. First operand 16586 states and 24486 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:00,787 INFO L93 Difference]: Finished difference Result 115098 states and 168430 transitions. [2024-10-11 04:57:00,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:01,027 INFO L225 Difference]: With dead ends: 115098 [2024-10-11 04:57:01,027 INFO L226 Difference]: Without dead ends: 105112 [2024-10-11 04:57:01,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:01,064 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 9845 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9845 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:01,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9845 Valid, 4605 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105112 states. [2024-10-11 04:57:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105112 to 28746. [2024-10-11 04:57:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28746 states, 28744 states have (on average 1.4641664347342054) internal successors, (42086), 28745 states have internal predecessors, (42086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28746 states to 28746 states and 42086 transitions. [2024-10-11 04:57:03,312 INFO L78 Accepts]: Start accepts. Automaton has 28746 states and 42086 transitions. Word has length 100 [2024-10-11 04:57:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:03,313 INFO L471 AbstractCegarLoop]: Abstraction has 28746 states and 42086 transitions. [2024-10-11 04:57:03,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28746 states and 42086 transitions. [2024-10-11 04:57:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:03,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:03,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:57:03,319 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1780977725, now seen corresponding path program 1 times [2024-10-11 04:57:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901901540] [2024-10-11 04:57:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:57:03,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:03,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901901540] [2024-10-11 04:57:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901901540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:03,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:03,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:03,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99172114] [2024-10-11 04:57:03,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:03,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:03,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:03,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:03,548 INFO L87 Difference]: Start difference. First operand 28746 states and 42086 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:07,044 INFO L93 Difference]: Finished difference Result 129370 states and 189166 transitions. [2024-10-11 04:57:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:07,310 INFO L225 Difference]: With dead ends: 129370 [2024-10-11 04:57:07,311 INFO L226 Difference]: Without dead ends: 115096 [2024-10-11 04:57:07,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:07,367 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 9845 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9845 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:07,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9845 Valid, 4598 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:57:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115096 states. [2024-10-11 04:57:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115096 to 48010. [2024-10-11 04:57:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48010 states, 48008 states have (on average 1.4565489085152474) internal successors, (69926), 48009 states have internal predecessors, (69926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48010 states to 48010 states and 69926 transitions. [2024-10-11 04:57:09,975 INFO L78 Accepts]: Start accepts. Automaton has 48010 states and 69926 transitions. Word has length 100 [2024-10-11 04:57:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:09,976 INFO L471 AbstractCegarLoop]: Abstraction has 48010 states and 69926 transitions. [2024-10-11 04:57:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48010 states and 69926 transitions. [2024-10-11 04:57:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:09,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:09,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:57:09,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2103602883, now seen corresponding path program 1 times [2024-10-11 04:57:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823178804] [2024-10-11 04:57:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:57:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823178804] [2024-10-11 04:57:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823178804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:10,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860474361] [2024-10-11 04:57:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:10,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:10,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:10,195 INFO L87 Difference]: Start difference. First operand 48010 states and 69926 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:13,445 INFO L93 Difference]: Finished difference Result 143642 states and 209838 transitions. [2024-10-11 04:57:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:14,078 INFO L225 Difference]: With dead ends: 143642 [2024-10-11 04:57:14,079 INFO L226 Difference]: Without dead ends: 129368 [2024-10-11 04:57:14,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:14,226 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 9868 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9868 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9868 Valid, 4510 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:57:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129368 states. [2024-10-11 04:57:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129368 to 62282. [2024-10-11 04:57:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62282 states, 62280 states have (on average 1.4546885035324342) internal successors, (90598), 62281 states have internal predecessors, (90598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62282 states to 62282 states and 90598 transitions. [2024-10-11 04:57:17,182 INFO L78 Accepts]: Start accepts. Automaton has 62282 states and 90598 transitions. Word has length 100 [2024-10-11 04:57:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:17,183 INFO L471 AbstractCegarLoop]: Abstraction has 62282 states and 90598 transitions. [2024-10-11 04:57:17,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62282 states and 90598 transitions. [2024-10-11 04:57:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:17,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:17,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:57:17,192 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1835019715, now seen corresponding path program 1 times [2024-10-11 04:57:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759562012] [2024-10-11 04:57:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:57:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759562012] [2024-10-11 04:57:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759562012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849225087] [2024-10-11 04:57:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:17,376 INFO L87 Difference]: Start difference. First operand 62282 states and 90598 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:21,792 INFO L93 Difference]: Finished difference Result 157914 states and 230510 transitions. [2024-10-11 04:57:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 100 [2024-10-11 04:57:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:22,105 INFO L225 Difference]: With dead ends: 157914 [2024-10-11 04:57:22,106 INFO L226 Difference]: Without dead ends: 143640 [2024-10-11 04:57:22,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:22,169 INFO L432 NwaCegarLoop]: 1655 mSDtfsCounter, 9955 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9955 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:22,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9955 Valid, 4453 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:57:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143640 states. [2024-10-11 04:57:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143640 to 76554. [2024-10-11 04:57:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76554 states, 76552 states have (on average 1.45352178911067) internal successors, (111270), 76553 states have internal predecessors, (111270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76554 states to 76554 states and 111270 transitions. [2024-10-11 04:57:26,117 INFO L78 Accepts]: Start accepts. Automaton has 76554 states and 111270 transitions. Word has length 100 [2024-10-11 04:57:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:26,118 INFO L471 AbstractCegarLoop]: Abstraction has 76554 states and 111270 transitions. [2024-10-11 04:57:26,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 76554 states and 111270 transitions. [2024-10-11 04:57:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:26,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:26,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:26,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:57:26,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1249307587, now seen corresponding path program 1 times [2024-10-11 04:57:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523166567] [2024-10-11 04:57:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:57:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523166567] [2024-10-11 04:57:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523166567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:26,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:26,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:26,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994871560] [2024-10-11 04:57:26,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:26,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:26,315 INFO L87 Difference]: Start difference. First operand 76554 states and 111270 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-10-11 04:57:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:57:30,912 INFO L93 Difference]: Finished difference Result 172186 states and 251182 transitions. [2024-10-11 04:57:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:57:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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 100 [2024-10-11 04:57:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:57:31,155 INFO L225 Difference]: With dead ends: 172186 [2024-10-11 04:57:31,156 INFO L226 Difference]: Without dead ends: 157912 [2024-10-11 04:57:31,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 04:57:31,193 INFO L432 NwaCegarLoop]: 1653 mSDtfsCounter, 10036 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10036 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:57:31,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10036 Valid, 4511 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:57:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157912 states. [2024-10-11 04:57:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157912 to 90826. [2024-10-11 04:57:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90826 states, 90824 states have (on average 1.4527217475557122) internal successors, (131942), 90825 states have internal predecessors, (131942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:57:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90826 states to 90826 states and 131942 transitions. [2024-10-11 04:57:36,644 INFO L78 Accepts]: Start accepts. Automaton has 90826 states and 131942 transitions. Word has length 100 [2024-10-11 04:57:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:57:36,645 INFO L471 AbstractCegarLoop]: Abstraction has 90826 states and 131942 transitions. [2024-10-11 04:57:36,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-10-11 04:57:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 90826 states and 131942 transitions. [2024-10-11 04:57:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:57:36,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:57:36,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:57:36,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:57:36,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:57:36,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:57:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2138041027, now seen corresponding path program 1 times [2024-10-11 04:57:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:57:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210490436] [2024-10-11 04:57:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:57:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:57:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:57:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:57:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:57:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210490436] [2024-10-11 04:57:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210490436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:57:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:57:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 04:57:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547900698] [2024-10-11 04:57:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:57:37,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:57:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:57:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:57:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:57:37,066 INFO L87 Difference]: Start difference. First operand 90826 states and 131942 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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)