./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 8c73977f942e89d9992bb22ca052cbbbf488baa4bd312066f1673eed7b40e630 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:42:39,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:42:39,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:42:39,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:42:39,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:42:39,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:42:39,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:42:39,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:42:39,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:42:39,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:42:39,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:42:39,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:42:39,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:42:39,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:42:39,943 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:42:39,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:42:39,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:42:39,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:42:39,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:42:39,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:42:39,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:42:39,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:42:39,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:42:39,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:42:39,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:42:39,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:42:39,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:42:39,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:42:39,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:42:39,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:42:39,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:42:39,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:42:39,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:42:39,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:42:39,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:42:39,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:42:39,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:42:39,954 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 -> 8c73977f942e89d9992bb22ca052cbbbf488baa4bd312066f1673eed7b40e630 [2024-10-11 03:42:40,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:42:40,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:42:40,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:42:40,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:42:40,221 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:42:40,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:42:41,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:42:41,829 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:42:41,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:42:41,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04b8adbb4/c6bffedd00f749faa3eab8cb47b85315/FLAGcdb209389 [2024-10-11 03:42:41,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/04b8adbb4/c6bffedd00f749faa3eab8cb47b85315 [2024-10-11 03:42:41,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:42:41,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:42:41,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:42:41,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:42:41,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:42:41,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:42:41" (1/1) ... [2024-10-11 03:42:41,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c18f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:41, skipping insertion in model container [2024-10-11 03:42:41,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:42:41" (1/1) ... [2024-10-11 03:42:41,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:42:42,165 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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2024-10-11 03:42:42,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:42:42,313 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:42:42,402 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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2024-10-11 03:42:42,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:42:42,473 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:42:42,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42 WrapperNode [2024-10-11 03:42:42,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:42:42,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:42:42,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:42:42,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:42:42,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,549 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 573 [2024-10-11 03:42:42,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:42:42,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:42:42,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:42:42,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:42:42,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,585 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 03:42:42,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:42:42,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:42:42,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:42:42,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:42:42,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (1/1) ... [2024-10-11 03:42:42,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:42:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:42:42,661 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 03:42:42,666 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 03:42:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:42:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:42:42,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:42:42,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:42:42,817 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:42:42,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:42:43,246 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 03:42:43,247 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:42:43,296 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:42:43,298 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:42:43,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:42:43 BoogieIcfgContainer [2024-10-11 03:42:43,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:42:43,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:42:43,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:42:43,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:42:43,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:42:41" (1/3) ... [2024-10-11 03:42:43,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10026e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:42:43, skipping insertion in model container [2024-10-11 03:42:43,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:42:42" (2/3) ... [2024-10-11 03:42:43,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10026e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:42:43, skipping insertion in model container [2024-10-11 03:42:43,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:42:43" (3/3) ... [2024-10-11 03:42:43,308 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:42:43,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:42:43,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:42:43,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:42:43,392 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;@7f4276c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:42:43,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:42:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 0 states 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 03:42:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:42:43,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:43,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:42:43,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1132032002, now seen corresponding path program 1 times [2024-10-11 03:42:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371329516] [2024-10-11 03:42:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:43,757 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 03:42:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371329516] [2024-10-11 03:42:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371329516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647884775] [2024-10-11 03:42:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:43,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:43,784 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 0 states have call successors, (0), 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 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:43,926 INFO L93 Difference]: Finished difference Result 324 states and 524 transitions. [2024-10-11 03:42:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:43,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:42:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:43,941 INFO L225 Difference]: With dead ends: 324 [2024-10-11 03:42:43,941 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 03:42:43,944 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 03:42:43,946 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 166 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 479 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:43,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:42:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 03:42:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-10-11 03:42:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5069767441860464) internal successors, (324), 215 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 03:42:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 324 transitions. [2024-10-11 03:42:43,983 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 324 transitions. Word has length 60 [2024-10-11 03:42:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:43,983 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 324 transitions. [2024-10-11 03:42:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 324 transitions. [2024-10-11 03:42:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:42:43,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:43,985 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] [2024-10-11 03:42:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:42:43,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1725262461, now seen corresponding path program 1 times [2024-10-11 03:42:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159654016] [2024-10-11 03:42:43,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:44,091 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 03:42:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159654016] [2024-10-11 03:42:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159654016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:44,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11179728] [2024-10-11 03:42:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:44,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:44,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:44,097 INFO L87 Difference]: Start difference. First operand 216 states and 324 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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 03:42:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:44,150 INFO L93 Difference]: Finished difference Result 548 states and 852 transitions. [2024-10-11 03:42:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-11 03:42:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:44,152 INFO L225 Difference]: With dead ends: 548 [2024-10-11 03:42:44,152 INFO L226 Difference]: Without dead ends: 366 [2024-10-11 03:42:44,153 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 03:42:44,154 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 137 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:44,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-11 03:42:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-10-11 03:42:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.5399449035812671) internal successors, (559), 363 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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 03:42:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 559 transitions. [2024-10-11 03:42:44,169 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 559 transitions. Word has length 61 [2024-10-11 03:42:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:44,169 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 559 transitions. [2024-10-11 03:42:44,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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 03:42:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 559 transitions. [2024-10-11 03:42:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:42:44,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:44,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] [2024-10-11 03:42:44,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:42:44,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:44,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -696211435, now seen corresponding path program 1 times [2024-10-11 03:42:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989215137] [2024-10-11 03:42:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:44,255 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 03:42:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989215137] [2024-10-11 03:42:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989215137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:44,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369870410] [2024-10-11 03:42:44,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:44,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:44,258 INFO L87 Difference]: Start difference. First operand 364 states and 559 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:44,288 INFO L93 Difference]: Finished difference Result 960 states and 1505 transitions. [2024-10-11 03:42:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 03:42:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:44,292 INFO L225 Difference]: With dead ends: 960 [2024-10-11 03:42:44,292 INFO L226 Difference]: Without dead ends: 630 [2024-10-11 03:42:44,295 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 03:42:44,296 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 132 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:44,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 407 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-10-11 03:42:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2024-10-11 03:42:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.555023923444976) internal successors, (975), 627 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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 03:42:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 975 transitions. [2024-10-11 03:42:44,327 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 975 transitions. Word has length 62 [2024-10-11 03:42:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 975 transitions. [2024-10-11 03:42:44,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 975 transitions. [2024-10-11 03:42:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:42:44,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:44,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:42:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:42:44,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1789306726, now seen corresponding path program 1 times [2024-10-11 03:42:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487641062] [2024-10-11 03:42:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:44,420 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 03:42:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:44,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487641062] [2024-10-11 03:42:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487641062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:44,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:44,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:44,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047108273] [2024-10-11 03:42:44,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:44,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:44,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:44,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:44,424 INFO L87 Difference]: Start difference. First operand 628 states and 975 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:44,448 INFO L93 Difference]: Finished difference Result 1688 states and 2649 transitions. [2024-10-11 03:42:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 03:42:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:44,453 INFO L225 Difference]: With dead ends: 1688 [2024-10-11 03:42:44,453 INFO L226 Difference]: Without dead ends: 1094 [2024-10-11 03:42:44,457 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 03:42:44,458 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 127 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:44,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-11 03:42:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1092. [2024-10-11 03:42:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.5572868927589367) internal successors, (1699), 1091 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states 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 03:42:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1699 transitions. [2024-10-11 03:42:44,544 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1699 transitions. Word has length 63 [2024-10-11 03:42:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:44,544 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1699 transitions. [2024-10-11 03:42:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:42:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1699 transitions. [2024-10-11 03:42:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:42:44,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:44,553 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] [2024-10-11 03:42:44,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:42:44,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 125702204, now seen corresponding path program 1 times [2024-10-11 03:42:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005664387] [2024-10-11 03:42:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:44,784 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 03:42:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005664387] [2024-10-11 03:42:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005664387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:42:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310125024] [2024-10-11 03:42:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:42:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:42:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:42:44,788 INFO L87 Difference]: Start difference. First operand 1092 states and 1699 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 03:42:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:44,961 INFO L93 Difference]: Finished difference Result 7440 states and 11689 transitions. [2024-10-11 03:42:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:42:44,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 03:42:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:44,983 INFO L225 Difference]: With dead ends: 7440 [2024-10-11 03:42:44,984 INFO L226 Difference]: Without dead ends: 6382 [2024-10-11 03:42:44,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:42:44,990 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1477 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:44,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2339 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:42:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2024-10-11 03:42:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 2148. [2024-10-11 03:42:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2147 states have (on average 1.551467163483931) internal successors, (3331), 2147 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states 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 03:42:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3331 transitions. [2024-10-11 03:42:45,093 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3331 transitions. Word has length 64 [2024-10-11 03:42:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:45,093 INFO L471 AbstractCegarLoop]: Abstraction has 2148 states and 3331 transitions. [2024-10-11 03:42:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 03:42:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3331 transitions. [2024-10-11 03:42:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:42:45,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:45,098 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] [2024-10-11 03:42:45,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:42:45,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash -417655209, now seen corresponding path program 1 times [2024-10-11 03:42:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108658945] [2024-10-11 03:42:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:45,313 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 03:42:45,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108658945] [2024-10-11 03:42:45,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108658945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:45,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:42:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384258071] [2024-10-11 03:42:45,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:45,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:42:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:42:45,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:42:45,317 INFO L87 Difference]: Start difference. First operand 2148 states and 3331 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 03:42:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:45,445 INFO L93 Difference]: Finished difference Result 11278 states and 17448 transitions. [2024-10-11 03:42:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:42:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 03:42:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:45,475 INFO L225 Difference]: With dead ends: 11278 [2024-10-11 03:42:45,476 INFO L226 Difference]: Without dead ends: 9164 [2024-10-11 03:42:45,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:42:45,486 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 781 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:45,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 960 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:42:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2024-10-11 03:42:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 9156. [2024-10-11 03:42:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9156 states, 9155 states have (on average 1.5417804478427088) internal successors, (14115), 9155 states have internal predecessors, (14115), 0 states have call successors, (0), 0 states 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 03:42:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9156 states to 9156 states and 14115 transitions. [2024-10-11 03:42:45,710 INFO L78 Accepts]: Start accepts. Automaton has 9156 states and 14115 transitions. Word has length 65 [2024-10-11 03:42:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 9156 states and 14115 transitions. [2024-10-11 03:42:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 03:42:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 9156 states and 14115 transitions. [2024-10-11 03:42:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:42:45,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:45,713 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] [2024-10-11 03:42:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:42:45,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 650635450, now seen corresponding path program 1 times [2024-10-11 03:42:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650000010] [2024-10-11 03:42:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:45,786 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 03:42:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650000010] [2024-10-11 03:42:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650000010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727605654] [2024-10-11 03:42:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:45,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:45,791 INFO L87 Difference]: Start difference. First operand 9156 states and 14115 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 03:42:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:45,879 INFO L93 Difference]: Finished difference Result 24680 states and 37893 transitions. [2024-10-11 03:42:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 03:42:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:45,918 INFO L225 Difference]: With dead ends: 24680 [2024-10-11 03:42:45,918 INFO L226 Difference]: Without dead ends: 15558 [2024-10-11 03:42:45,933 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 03:42:45,934 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 144 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:45,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 462 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15558 states. [2024-10-11 03:42:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15558 to 15556. [2024-10-11 03:42:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15556 states, 15555 states have (on average 1.520475731276117) internal successors, (23651), 15555 states have internal predecessors, (23651), 0 states have call successors, (0), 0 states 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 03:42:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15556 states to 15556 states and 23651 transitions. [2024-10-11 03:42:46,262 INFO L78 Accepts]: Start accepts. Automaton has 15556 states and 23651 transitions. Word has length 66 [2024-10-11 03:42:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:46,262 INFO L471 AbstractCegarLoop]: Abstraction has 15556 states and 23651 transitions. [2024-10-11 03:42:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 03:42:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 15556 states and 23651 transitions. [2024-10-11 03:42:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:42:46,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:46,263 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] [2024-10-11 03:42:46,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:42:46,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash -889607872, now seen corresponding path program 1 times [2024-10-11 03:42:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525178] [2024-10-11 03:42:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:46,496 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 03:42:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525178] [2024-10-11 03:42:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408525178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:46,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:42:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071974486] [2024-10-11 03:42:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:42:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:46,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:42:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:42:46,499 INFO L87 Difference]: Start difference. First operand 15556 states and 23651 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:42:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:46,740 INFO L93 Difference]: Finished difference Result 46600 states and 70885 transitions. [2024-10-11 03:42:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:42:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:42:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:46,794 INFO L225 Difference]: With dead ends: 46600 [2024-10-11 03:42:46,794 INFO L226 Difference]: Without dead ends: 31078 [2024-10-11 03:42:46,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:42:46,817 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 843 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:46,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 216 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:42:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31078 states. [2024-10-11 03:42:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31078 to 31076. [2024-10-11 03:42:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31076 states, 31075 states have (on average 1.5117940466613033) internal successors, (46979), 31075 states have internal predecessors, (46979), 0 states have call successors, (0), 0 states 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 03:42:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31076 states to 31076 states and 46979 transitions. [2024-10-11 03:42:47,607 INFO L78 Accepts]: Start accepts. Automaton has 31076 states and 46979 transitions. Word has length 67 [2024-10-11 03:42:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:47,607 INFO L471 AbstractCegarLoop]: Abstraction has 31076 states and 46979 transitions. [2024-10-11 03:42:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:42:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31076 states and 46979 transitions. [2024-10-11 03:42:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:42:47,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:47,609 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] [2024-10-11 03:42:47,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:42:47,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:47,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2008403493, now seen corresponding path program 1 times [2024-10-11 03:42:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312178738] [2024-10-11 03:42:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:47,937 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 03:42:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312178738] [2024-10-11 03:42:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312178738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:47,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:42:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309837152] [2024-10-11 03:42:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:42:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:42:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:42:47,939 INFO L87 Difference]: Start difference. First operand 31076 states and 46979 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:42:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:48,027 INFO L93 Difference]: Finished difference Result 32358 states and 48900 transitions. [2024-10-11 03:42:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:42:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-11 03:42:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:48,068 INFO L225 Difference]: With dead ends: 32358 [2024-10-11 03:42:48,069 INFO L226 Difference]: Without dead ends: 32356 [2024-10-11 03:42:48,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:42:48,081 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:48,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32356 states. [2024-10-11 03:42:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32356 to 32356. [2024-10-11 03:42:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32356 states, 32355 states have (on average 1.4915469015608098) internal successors, (48259), 32355 states have internal predecessors, (48259), 0 states have call successors, (0), 0 states 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 03:42:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32356 states to 32356 states and 48259 transitions. [2024-10-11 03:42:48,730 INFO L78 Accepts]: Start accepts. Automaton has 32356 states and 48259 transitions. Word has length 67 [2024-10-11 03:42:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 32356 states and 48259 transitions. [2024-10-11 03:42:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:42:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32356 states and 48259 transitions. [2024-10-11 03:42:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:42:48,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:48,732 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] [2024-10-11 03:42:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:42:48,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2141539230, now seen corresponding path program 1 times [2024-10-11 03:42:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042356753] [2024-10-11 03:42:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:48,788 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 03:42:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042356753] [2024-10-11 03:42:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042356753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:48,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234715247] [2024-10-11 03:42:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:48,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:48,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:48,790 INFO L87 Difference]: Start difference. First operand 32356 states and 48259 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 03:42:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:49,124 INFO L93 Difference]: Finished difference Result 72282 states and 107623 transitions. [2024-10-11 03:42:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:49,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-11 03:42:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:49,174 INFO L225 Difference]: With dead ends: 72282 [2024-10-11 03:42:49,175 INFO L226 Difference]: Without dead ends: 39960 [2024-10-11 03:42:49,207 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 03:42:49,208 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 114 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:49,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39960 states. [2024-10-11 03:42:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39960 to 39814. [2024-10-11 03:42:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39814 states, 39813 states have (on average 1.4810489036244443) internal successors, (58965), 39813 states have internal predecessors, (58965), 0 states have call successors, (0), 0 states 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 03:42:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39814 states to 39814 states and 58965 transitions. [2024-10-11 03:42:50,147 INFO L78 Accepts]: Start accepts. Automaton has 39814 states and 58965 transitions. Word has length 68 [2024-10-11 03:42:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:50,147 INFO L471 AbstractCegarLoop]: Abstraction has 39814 states and 58965 transitions. [2024-10-11 03:42:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 03:42:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 39814 states and 58965 transitions. [2024-10-11 03:42:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:42:50,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:50,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:42:50,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:42:50,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:50,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1989798597, now seen corresponding path program 1 times [2024-10-11 03:42:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669332628] [2024-10-11 03:42:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:42:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669332628] [2024-10-11 03:42:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669332628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:42:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:42:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:42:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264726669] [2024-10-11 03:42:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:42:50,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:42:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:42:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:42:50,218 INFO L87 Difference]: Start difference. First operand 39814 states and 58965 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 03:42:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:42:50,541 INFO L93 Difference]: Finished difference Result 102667 states and 152217 transitions. [2024-10-11 03:42:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:42:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2024-10-11 03:42:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:42:50,624 INFO L225 Difference]: With dead ends: 102667 [2024-10-11 03:42:50,624 INFO L226 Difference]: Without dead ends: 69257 [2024-10-11 03:42:50,640 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 03:42:50,641 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 117 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:42:50,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 479 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:42:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69257 states. [2024-10-11 03:42:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69257 to 69255. [2024-10-11 03:42:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69255 states, 69254 states have (on average 1.470860888901724) internal successors, (101863), 69254 states have internal predecessors, (101863), 0 states have call successors, (0), 0 states 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 03:42:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69255 states to 69255 states and 101863 transitions. [2024-10-11 03:42:51,682 INFO L78 Accepts]: Start accepts. Automaton has 69255 states and 101863 transitions. Word has length 95 [2024-10-11 03:42:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:42:51,683 INFO L471 AbstractCegarLoop]: Abstraction has 69255 states and 101863 transitions. [2024-10-11 03:42:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 03:42:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 69255 states and 101863 transitions. [2024-10-11 03:42:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:42:51,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:42:51,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:42:51,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:42:51,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:42:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:42:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1309326168, now seen corresponding path program 1 times [2024-10-11 03:42:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:42:51,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999875154] [2024-10-11 03:42:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:42:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:42:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:42:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999875154] [2024-10-11 03:42:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999875154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:42:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156424969] [2024-10-11 03:42:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:42:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:42:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:42:52,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:42:52,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:42:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:42:52,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:42:52,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:42:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:42:53,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:42:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:42:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156424969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:42:53,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:42:53,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-11 03:42:53,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658871339] [2024-10-11 03:42:53,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:42:53,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:42:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:42:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:42:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:42:53,547 INFO L87 Difference]: Start difference. First operand 69255 states and 101863 transitions. Second operand has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 03:43:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:43:04,939 INFO L93 Difference]: Finished difference Result 495257 states and 727187 transitions. [2024-10-11 03:43:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-11 03:43:04,943 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 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 95 [2024-10-11 03:43:04,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:43:05,723 INFO L225 Difference]: With dead ends: 495257 [2024-10-11 03:43:05,724 INFO L226 Difference]: Without dead ends: 426039 [2024-10-11 03:43:05,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4248, Invalid=22812, Unknown=0, NotChecked=0, Total=27060 [2024-10-11 03:43:05,838 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 19351 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 4410 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19351 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 4581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 4410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:43:05,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19351 Valid, 4782 Invalid, 4581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 4410 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 03:43:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426039 states. [2024-10-11 03:43:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426039 to 335784. [2024-10-11 03:43:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335784 states, 335783 states have (on average 1.4490280925478658) internal successors, (486559), 335783 states have internal predecessors, (486559), 0 states have call successors, (0), 0 states 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 03:43:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335784 states to 335784 states and 486559 transitions. [2024-10-11 03:43:13,382 INFO L78 Accepts]: Start accepts. Automaton has 335784 states and 486559 transitions. Word has length 95 [2024-10-11 03:43:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:43:13,382 INFO L471 AbstractCegarLoop]: Abstraction has 335784 states and 486559 transitions. [2024-10-11 03:43:13,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.85) internal successors, (277), 20 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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 03:43:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 335784 states and 486559 transitions. [2024-10-11 03:43:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:43:13,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:43:13,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:43:13,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:43:13,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:43:13,640 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:43:13,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:43:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 559492012, now seen corresponding path program 1 times [2024-10-11 03:43:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:43:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750843587] [2024-10-11 03:43:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:43:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:43:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:43:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:43:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:43:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750843587] [2024-10-11 03:43:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750843587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:43:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:43:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:43:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843852742] [2024-10-11 03:43:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:43:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:43:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:43:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:43:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:43:13,762 INFO L87 Difference]: Start difference. First operand 335784 states and 486559 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 03:43:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:43:16,873 INFO L93 Difference]: Finished difference Result 809815 states and 1171868 transitions. [2024-10-11 03:43:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:43:16,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:43:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:43:18,877 INFO L225 Difference]: With dead ends: 809815 [2024-10-11 03:43:18,877 INFO L226 Difference]: Without dead ends: 539091 [2024-10-11 03:43:19,077 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 03:43:19,078 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 115 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:43:19,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 427 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:43:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539091 states. [2024-10-11 03:43:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539091 to 539089. [2024-10-11 03:43:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539089 states, 539088 states have (on average 1.4352499035407948) internal successors, (773726), 539088 states have internal predecessors, (773726), 0 states have call successors, (0), 0 states 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 03:43:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539089 states to 539089 states and 773726 transitions. [2024-10-11 03:43:29,055 INFO L78 Accepts]: Start accepts. Automaton has 539089 states and 773726 transitions. Word has length 96 [2024-10-11 03:43:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:43:29,056 INFO L471 AbstractCegarLoop]: Abstraction has 539089 states and 773726 transitions. [2024-10-11 03:43:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 03:43:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 539089 states and 773726 transitions. [2024-10-11 03:43:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:43:29,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:43:29,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:43:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:43:29,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:43:29,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:43:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1284617306, now seen corresponding path program 1 times [2024-10-11 03:43:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:43:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185879416] [2024-10-11 03:43:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:43:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:43:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:43:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:43:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:43:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185879416] [2024-10-11 03:43:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185879416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:43:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:43:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:43:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215250866] [2024-10-11 03:43:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:43:29,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:43:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:43:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:43:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:43:29,176 INFO L87 Difference]: Start difference. First operand 539089 states and 773726 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 03:43:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:43:33,206 INFO L93 Difference]: Finished difference Result 863192 states and 1237536 transitions. [2024-10-11 03:43:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:43:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:43:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:43:34,329 INFO L225 Difference]: With dead ends: 863192 [2024-10-11 03:43:34,329 INFO L226 Difference]: Without dead ends: 539091 [2024-10-11 03:43:34,619 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 03:43:34,620 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:43:34,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 396 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:43:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539091 states.