./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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:27:33,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:27:33,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:27:33,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:27:33,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:27:33,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:27:33,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:27:33,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:27:33,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:27:33,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:27:33,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:27:33,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:27:33,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:27:33,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:27:33,713 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:27:33,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:27:33,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:27:33,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:27:33,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:27:33,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:27:33,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:27:33,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:27:33,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:27:33,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:27:33,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:27:33,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:27:33,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:27:33,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:27:33,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:27:33,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:27:33,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:27:33,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:27:33,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:27:33,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:27:33,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:27:33,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:27:33,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:27:33,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:27:33,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:27:33,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:27:33,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:27:33,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:27:33,723 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 [2024-10-12 20:27:33,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:27:33,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:27:34,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:27:34,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:27:34,003 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:27:34,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:27:35,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:27:35,607 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:27:35,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:27:35,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18533d2c7/adc3b51eafb9414b936249e7e0c6fe37/FLAGe64ef04d3 [2024-10-12 20:27:35,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18533d2c7/adc3b51eafb9414b936249e7e0c6fe37 [2024-10-12 20:27:35,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:27:35,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:27:35,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:27:35,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:27:35,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:27:35,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:27:35" (1/1) ... [2024-10-12 20:27:35,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b23b122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:35, skipping insertion in model container [2024-10-12 20:27:35,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:27:35" (1/1) ... [2024-10-12 20:27:35,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:27:35,898 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-10-12 20:27:35,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:27:35,939 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:27:35,992 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.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-10-12 20:27:36,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:27:36,031 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:27:36,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36 WrapperNode [2024-10-12 20:27:36,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:27:36,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:27:36,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:27:36,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:27:36,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,091 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 370 [2024-10-12 20:27:36,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:27:36,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:27:36,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:27:36,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:27:36,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:27:36,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:27:36,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:27:36,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:27:36,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:27:36,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (1/1) ... [2024-10-12 20:27:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:27:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:36,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:27:36,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:27:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:27:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:27:36,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:27:36,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:27:36,411 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:27:36,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:27:36,890 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-12 20:27:36,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:27:36,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:27:36,941 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:27:36,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:27:36 BoogieIcfgContainer [2024-10-12 20:27:36,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:27:36,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:27:36,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:27:36,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:27:36,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:27:35" (1/3) ... [2024-10-12 20:27:36,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f68141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:27:36, skipping insertion in model container [2024-10-12 20:27:36,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:36" (2/3) ... [2024-10-12 20:27:36,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f68141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:27:36, skipping insertion in model container [2024-10-12 20:27:36,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:27:36" (3/3) ... [2024-10-12 20:27:36,952 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:27:36,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:27:36,966 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:27:37,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:27:37,024 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;@7b37a9bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:27:37,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:27:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:27:37,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:37,034 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] [2024-10-12 20:27:37,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1629204617, now seen corresponding path program 1 times [2024-10-12 20:27:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95048718] [2024-10-12 20:27:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95048718] [2024-10-12 20:27:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95048718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:37,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032695513] [2024-10-12 20:27:37,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:37,492 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:37,555 INFO L93 Difference]: Finished difference Result 179 states and 288 transitions. [2024-10-12 20:27:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-12 20:27:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:37,567 INFO L225 Difference]: With dead ends: 179 [2024-10-12 20:27:37,567 INFO L226 Difference]: Without dead ends: 121 [2024-10-12 20:27:37,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:37,574 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 83 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:37,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-12 20:27:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-12 20:27:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 118 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-10-12 20:27:37,615 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 47 [2024-10-12 20:27:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:37,616 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-10-12 20:27:37,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-10-12 20:27:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:27:37,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:37,618 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] [2024-10-12 20:27:37,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:27:37,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:37,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:37,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1771605490, now seen corresponding path program 1 times [2024-10-12 20:27:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:37,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12031218] [2024-10-12 20:27:37,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:37,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12031218] [2024-10-12 20:27:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12031218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080412046] [2024-10-12 20:27:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:37,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:37,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:37,769 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:37,800 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2024-10-12 20:27:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-12 20:27:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:37,805 INFO L225 Difference]: With dead ends: 291 [2024-10-12 20:27:37,805 INFO L226 Difference]: Without dead ends: 197 [2024-10-12 20:27:37,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:37,807 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 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-12 20:27:37,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-12 20:27:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-10-12 20:27:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.5154639175257731) internal successors, (294), 194 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2024-10-12 20:27:37,839 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 48 [2024-10-12 20:27:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2024-10-12 20:27:37,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2024-10-12 20:27:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:27:37,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:37,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:37,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:27:37,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:37,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash -445382270, now seen corresponding path program 1 times [2024-10-12 20:27:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098364730] [2024-10-12 20:27:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098364730] [2024-10-12 20:27:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098364730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:38,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:38,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814353738] [2024-10-12 20:27:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:38,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:38,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:38,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:38,033 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:38,067 INFO L93 Difference]: Finished difference Result 503 states and 780 transitions. [2024-10-12 20:27:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:38,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-12 20:27:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:38,072 INFO L225 Difference]: With dead ends: 503 [2024-10-12 20:27:38,073 INFO L226 Difference]: Without dead ends: 333 [2024-10-12 20:27:38,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-12 20:27:38,078 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 225 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-12 20:27:38,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-12 20:27:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2024-10-12 20:27:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.5333333333333334) internal successors, (506), 330 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 506 transitions. [2024-10-12 20:27:38,113 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 506 transitions. Word has length 49 [2024-10-12 20:27:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:38,114 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 506 transitions. [2024-10-12 20:27:38,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2024-10-12 20:27:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:27:38,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:38,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:38,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:27:38,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:38,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1984957637, now seen corresponding path program 1 times [2024-10-12 20:27:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908581058] [2024-10-12 20:27:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:38,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908581058] [2024-10-12 20:27:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908581058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:38,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265721780] [2024-10-12 20:27:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:38,332 INFO L87 Difference]: Start difference. First operand 331 states and 506 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:38,537 INFO L93 Difference]: Finished difference Result 2779 states and 4354 transitions. [2024-10-12 20:27:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:27:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-12 20:27:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:38,548 INFO L225 Difference]: With dead ends: 2779 [2024-10-12 20:27:38,549 INFO L226 Difference]: Without dead ends: 2473 [2024-10-12 20:27:38,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:27:38,552 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 697 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:38,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-12 20:27:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 635. [2024-10-12 20:27:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.5299684542586751) internal successors, (970), 634 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 970 transitions. [2024-10-12 20:27:38,609 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 970 transitions. Word has length 50 [2024-10-12 20:27:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 970 transitions. [2024-10-12 20:27:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 970 transitions. [2024-10-12 20:27:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:27:38,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:38,611 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] [2024-10-12 20:27:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:27:38,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -322009632, now seen corresponding path program 1 times [2024-10-12 20:27:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695912812] [2024-10-12 20:27:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695912812] [2024-10-12 20:27:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695912812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861897233] [2024-10-12 20:27:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:38,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:38,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:38,917 INFO L87 Difference]: Start difference. First operand 635 states and 970 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:39,037 INFO L93 Difference]: Finished difference Result 1247 states and 1916 transitions. [2024-10-12 20:27:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:27:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:39,040 INFO L225 Difference]: With dead ends: 1247 [2024-10-12 20:27:39,041 INFO L226 Difference]: Without dead ends: 637 [2024-10-12 20:27:39,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:27:39,044 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 116 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:39,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-12 20:27:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2024-10-12 20:27:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.5173501577287065) internal successors, (962), 634 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 962 transitions. [2024-10-12 20:27:39,061 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 962 transitions. Word has length 52 [2024-10-12 20:27:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,062 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 962 transitions. [2024-10-12 20:27:39,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 962 transitions. [2024-10-12 20:27:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:27:39,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,064 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] [2024-10-12 20:27:39,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:27:39,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:39,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash -343012287, now seen corresponding path program 1 times [2024-10-12 20:27:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411328622] [2024-10-12 20:27:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411328622] [2024-10-12 20:27:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411328622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115562825] [2024-10-12 20:27:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:39,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:39,179 INFO L87 Difference]: Start difference. First operand 635 states and 962 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:39,211 INFO L93 Difference]: Finished difference Result 1767 states and 2684 transitions. [2024-10-12 20:27:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:39,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:27:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:39,218 INFO L225 Difference]: With dead ends: 1767 [2024-10-12 20:27:39,218 INFO L226 Difference]: Without dead ends: 1157 [2024-10-12 20:27:39,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:39,223 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:39,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-12 20:27:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1139. [2024-10-12 20:27:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4850615114235501) internal successors, (1690), 1138 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1690 transitions. [2024-10-12 20:27:39,248 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1690 transitions. Word has length 52 [2024-10-12 20:27:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,248 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1690 transitions. [2024-10-12 20:27:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1690 transitions. [2024-10-12 20:27:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:39,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:27:39,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1394273389, now seen corresponding path program 1 times [2024-10-12 20:27:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842525769] [2024-10-12 20:27:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842525769] [2024-10-12 20:27:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842525769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108133123] [2024-10-12 20:27:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:39,364 INFO L87 Difference]: Start difference. First operand 1139 states and 1690 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:39,449 INFO L93 Difference]: Finished difference Result 2253 states and 3355 transitions. [2024-10-12 20:27:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:39,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:27:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:39,453 INFO L225 Difference]: With dead ends: 2253 [2024-10-12 20:27:39,453 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 20:27:39,455 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-12 20:27:39,456 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 258 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:39,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 84 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 20:27:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-12 20:27:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4710017574692442) internal successors, (1674), 1138 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1674 transitions. [2024-10-12 20:27:39,476 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1674 transitions. Word has length 53 [2024-10-12 20:27:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,477 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1674 transitions. [2024-10-12 20:27:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1674 transitions. [2024-10-12 20:27:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:39,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:27:39,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:39,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash -528741000, now seen corresponding path program 1 times [2024-10-12 20:27:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321189192] [2024-10-12 20:27:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321189192] [2024-10-12 20:27:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321189192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032628825] [2024-10-12 20:27:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:39,599 INFO L87 Difference]: Start difference. First operand 1139 states and 1674 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:39,676 INFO L93 Difference]: Finished difference Result 2253 states and 3323 transitions. [2024-10-12 20:27:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:27:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:39,681 INFO L225 Difference]: With dead ends: 2253 [2024-10-12 20:27:39,681 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 20:27:39,682 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-12 20:27:39,683 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 242 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:39,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 92 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 20:27:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-12 20:27:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4569420035149385) internal successors, (1658), 1138 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1658 transitions. [2024-10-12 20:27:39,704 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1658 transitions. Word has length 53 [2024-10-12 20:27:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,704 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1658 transitions. [2024-10-12 20:27:39,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1658 transitions. [2024-10-12 20:27:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:39,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:27:39,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1058031501, now seen corresponding path program 1 times [2024-10-12 20:27:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679785581] [2024-10-12 20:27:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:39,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-12 20:27:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679785581] [2024-10-12 20:27:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679785581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884867305] [2024-10-12 20:27:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:39,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:39,787 INFO L87 Difference]: Start difference. First operand 1139 states and 1658 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:39,860 INFO L93 Difference]: Finished difference Result 2253 states and 3291 transitions. [2024-10-12 20:27:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:27:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:39,865 INFO L225 Difference]: With dead ends: 2253 [2024-10-12 20:27:39,865 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 20:27:39,866 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-12 20:27:39,867 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:39,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 76 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 20:27:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-12 20:27:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4428822495606326) internal successors, (1642), 1138 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1642 transitions. [2024-10-12 20:27:39,894 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1642 transitions. Word has length 53 [2024-10-12 20:27:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:39,895 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1642 transitions. [2024-10-12 20:27:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1642 transitions. [2024-10-12 20:27:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:39,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:39,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:27:39,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -929946194, now seen corresponding path program 1 times [2024-10-12 20:27:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-10-12 20:27:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-10-12 20:27:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063930922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:40,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920063551] [2024-10-12 20:27:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:40,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:40,127 INFO L87 Difference]: Start difference. First operand 1139 states and 1642 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:40,165 INFO L93 Difference]: Finished difference Result 1173 states and 1691 transitions. [2024-10-12 20:27:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:40,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:27:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:40,171 INFO L225 Difference]: With dead ends: 1173 [2024-10-12 20:27:40,171 INFO L226 Difference]: Without dead ends: 1171 [2024-10-12 20:27:40,171 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-12 20:27:40,172 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:40,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-12 20:27:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2024-10-12 20:27:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.423931623931624) internal successors, (1666), 1170 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1666 transitions. [2024-10-12 20:27:40,201 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1666 transitions. Word has length 53 [2024-10-12 20:27:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:40,201 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1666 transitions. [2024-10-12 20:27:40,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1666 transitions. [2024-10-12 20:27:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:40,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:40,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:27:40,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1102304960, now seen corresponding path program 1 times [2024-10-12 20:27:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406118685] [2024-10-12 20:27:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406118685] [2024-10-12 20:27:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406118685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719468021] [2024-10-12 20:27:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:40,265 INFO L87 Difference]: Start difference. First operand 1171 states and 1666 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:40,287 INFO L93 Difference]: Finished difference Result 2298 states and 3304 transitions. [2024-10-12 20:27:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-12 20:27:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:40,293 INFO L225 Difference]: With dead ends: 2298 [2024-10-12 20:27:40,294 INFO L226 Difference]: Without dead ends: 1655 [2024-10-12 20:27:40,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-12 20:27:40,295 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 232 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-12 20:27:40,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-12 20:27:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1653. [2024-10-12 20:27:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1652 states have (on average 1.4164648910411621) internal successors, (2340), 1652 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2340 transitions. [2024-10-12 20:27:40,329 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2340 transitions. Word has length 53 [2024-10-12 20:27:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:40,329 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2340 transitions. [2024-10-12 20:27:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2340 transitions. [2024-10-12 20:27:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:27:40,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:40,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:40,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:27:40,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -363391418, now seen corresponding path program 1 times [2024-10-12 20:27:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:40,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250859097] [2024-10-12 20:27:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:27:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250859097] [2024-10-12 20:27:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250859097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791628509] [2024-10-12 20:27:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:40,459 INFO L87 Difference]: Start difference. First operand 1653 states and 2340 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:40,577 INFO L93 Difference]: Finished difference Result 8471 states and 12021 transitions. [2024-10-12 20:27:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:40,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:27:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:40,597 INFO L225 Difference]: With dead ends: 8471 [2024-10-12 20:27:40,597 INFO L226 Difference]: Without dead ends: 6845 [2024-10-12 20:27:40,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:40,603 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 489 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:40,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 546 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2024-10-12 20:27:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 3277. [2024-10-12 20:27:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3276 states have (on average 1.4126984126984128) internal successors, (4628), 3276 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4628 transitions. [2024-10-12 20:27:40,677 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4628 transitions. Word has length 76 [2024-10-12 20:27:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:40,678 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 4628 transitions. [2024-10-12 20:27:40,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4628 transitions. [2024-10-12 20:27:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:27:40,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:40,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:40,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:27:40,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:40,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1517337524, now seen corresponding path program 1 times [2024-10-12 20:27:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:40,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422489350] [2024-10-12 20:27:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:27:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422489350] [2024-10-12 20:27:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422489350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829333435] [2024-10-12 20:27:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:40,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:40,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:40,833 INFO L87 Difference]: Start difference. First operand 3277 states and 4628 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-12 20:27:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:40,999 INFO L93 Difference]: Finished difference Result 10095 states and 14309 transitions. [2024-10-12 20:27:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 76 [2024-10-12 20:27:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:41,027 INFO L225 Difference]: With dead ends: 10095 [2024-10-12 20:27:41,028 INFO L226 Difference]: Without dead ends: 8469 [2024-10-12 20:27:41,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:41,033 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 472 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:41,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 575 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2024-10-12 20:27:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 5717. [2024-10-12 20:27:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 5716 states have (on average 1.4065780265920225) internal successors, (8040), 5716 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 8040 transitions. [2024-10-12 20:27:41,156 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 8040 transitions. Word has length 76 [2024-10-12 20:27:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:41,157 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 8040 transitions. [2024-10-12 20:27:41,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-12 20:27:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 8040 transitions. [2024-10-12 20:27:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:27:41,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:41,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:27:41,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:41,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1221292096, now seen corresponding path program 1 times [2024-10-12 20:27:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353649780] [2024-10-12 20:27:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 20:27:41,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353649780] [2024-10-12 20:27:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353649780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:41,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009002213] [2024-10-12 20:27:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:41,292 INFO L87 Difference]: Start difference. First operand 5717 states and 8040 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:41,437 INFO L93 Difference]: Finished difference Result 11719 states and 16597 transitions. [2024-10-12 20:27:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:27:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:41,467 INFO L225 Difference]: With dead ends: 11719 [2024-10-12 20:27:41,467 INFO L226 Difference]: Without dead ends: 10093 [2024-10-12 20:27:41,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:41,474 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 441 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:41,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 643 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2024-10-12 20:27:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 7341. [2024-10-12 20:27:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7341 states, 7340 states have (on average 1.40708446866485) internal successors, (10328), 7340 states have internal predecessors, (10328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10328 transitions. [2024-10-12 20:27:41,648 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10328 transitions. Word has length 76 [2024-10-12 20:27:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:41,649 INFO L471 AbstractCegarLoop]: Abstraction has 7341 states and 10328 transitions. [2024-10-12 20:27:41,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10328 transitions. [2024-10-12 20:27:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:27:41,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:41,651 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:27:41,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:27:41,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:41,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1706727076, now seen corresponding path program 1 times [2024-10-12 20:27:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:41,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327884496] [2024-10-12 20:27:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:27:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327884496] [2024-10-12 20:27:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327884496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:41,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521871261] [2024-10-12 20:27:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:41,786 INFO L87 Difference]: Start difference. First operand 7341 states and 10328 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:41,923 INFO L93 Difference]: Finished difference Result 12335 states and 17493 transitions. [2024-10-12 20:27:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:27:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:41,945 INFO L225 Difference]: With dead ends: 12335 [2024-10-12 20:27:41,945 INFO L226 Difference]: Without dead ends: 11213 [2024-10-12 20:27:41,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:41,953 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 432 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:41,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 600 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2024-10-12 20:27:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 8461. [2024-10-12 20:27:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8461 states, 8460 states have (on average 1.4099290780141844) internal successors, (11928), 8460 states have internal predecessors, (11928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 11928 transitions. [2024-10-12 20:27:42,123 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 11928 transitions. Word has length 77 [2024-10-12 20:27:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:42,124 INFO L471 AbstractCegarLoop]: Abstraction has 8461 states and 11928 transitions. [2024-10-12 20:27:42,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 11928 transitions. [2024-10-12 20:27:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:27:42,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:42,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:27:42,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2067346209, now seen corresponding path program 1 times [2024-10-12 20:27:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425558063] [2024-10-12 20:27:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425558063] [2024-10-12 20:27:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425558063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320568193] [2024-10-12 20:27:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:42,218 INFO L87 Difference]: Start difference. First operand 8461 states and 11928 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:42,260 INFO L93 Difference]: Finished difference Result 14657 states and 20768 transitions. [2024-10-12 20:27:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 20:27:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:42,276 INFO L225 Difference]: With dead ends: 14657 [2024-10-12 20:27:42,277 INFO L226 Difference]: Without dead ends: 6223 [2024-10-12 20:27:42,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:42,286 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 48 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:42,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2024-10-12 20:27:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6221. [2024-10-12 20:27:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 6220 states have (on average 1.4110932475884244) internal successors, (8777), 6220 states have internal predecessors, (8777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 8777 transitions. [2024-10-12 20:27:42,435 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 8777 transitions. Word has length 78 [2024-10-12 20:27:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:42,436 INFO L471 AbstractCegarLoop]: Abstraction has 6221 states and 8777 transitions. [2024-10-12 20:27:42,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 8777 transitions. [2024-10-12 20:27:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:27:42,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:42,438 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] [2024-10-12 20:27:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:27:42,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 652706646, now seen corresponding path program 1 times [2024-10-12 20:27:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548153338] [2024-10-12 20:27:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:42,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548153338] [2024-10-12 20:27:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548153338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:27:42,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822371465] [2024-10-12 20:27:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:42,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:42,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:27:42,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:27:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:43,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:27:43,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:43,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822371465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:43,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2024-10-12 20:27:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438314081] [2024-10-12 20:27:43,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 20:27:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 20:27:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:27:43,916 INFO L87 Difference]: Start difference. First operand 6221 states and 8777 transitions. Second operand has 21 states, 21 states have (on average 10.714285714285714) internal successors, (225), 21 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:50,513 INFO L93 Difference]: Finished difference Result 77686 states and 107587 transitions. [2024-10-12 20:27:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-12 20:27:50,514 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.714285714285714) internal successors, (225), 21 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 20:27:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:50,657 INFO L225 Difference]: With dead ends: 77686 [2024-10-12 20:27:50,657 INFO L226 Difference]: Without dead ends: 70819 [2024-10-12 20:27:50,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11948 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3904, Invalid=24488, Unknown=0, NotChecked=0, Total=28392 [2024-10-12 20:27:50,695 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 4081 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:50,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 1451 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:27:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70819 states. [2024-10-12 20:27:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70819 to 54653. [2024-10-12 20:27:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54653 states, 54652 states have (on average 1.3814316036009662) internal successors, (75498), 54652 states have internal predecessors, (75498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54653 states to 54653 states and 75498 transitions. [2024-10-12 20:27:51,854 INFO L78 Accepts]: Start accepts. Automaton has 54653 states and 75498 transitions. Word has length 78 [2024-10-12 20:27:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:51,855 INFO L471 AbstractCegarLoop]: Abstraction has 54653 states and 75498 transitions. [2024-10-12 20:27:51,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.714285714285714) internal successors, (225), 21 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54653 states and 75498 transitions. [2024-10-12 20:27:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:27:51,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:51,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:51,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:27:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 20:27:52,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1819422508, now seen corresponding path program 1 times [2024-10-12 20:27:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647449598] [2024-10-12 20:27:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647449598] [2024-10-12 20:27:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647449598] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:27:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418258854] [2024-10-12 20:27:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:52,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:27:52,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:27:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:52,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:27:52,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:53,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418258854] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:53,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:53,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-10-12 20:27:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557283278] [2024-10-12 20:27:53,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:53,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:27:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:27:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:27:53,972 INFO L87 Difference]: Start difference. First operand 54653 states and 75498 transitions. Second operand has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 26 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:58,264 INFO L93 Difference]: Finished difference Result 498014 states and 679813 transitions. [2024-10-12 20:27:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-10-12 20:27:58,265 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 26 states have internal predecessors, (209), 0 states have call successors, (0), 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 79 [2024-10-12 20:27:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:59,225 INFO L225 Difference]: With dead ends: 498014 [2024-10-12 20:27:59,225 INFO L226 Difference]: Without dead ends: 443390 [2024-10-12 20:27:59,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3231 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1745, Invalid=8557, Unknown=0, NotChecked=0, Total=10302 [2024-10-12 20:27:59,358 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 4539 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4539 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:59,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4539 Valid, 1222 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:27:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443390 states. [2024-10-12 20:28:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443390 to 289851. [2024-10-12 20:28:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289851 states, 289850 states have (on average 1.3659962049335863) internal successors, (395934), 289850 states have internal predecessors, (395934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289851 states to 289851 states and 395934 transitions. [2024-10-12 20:28:05,468 INFO L78 Accepts]: Start accepts. Automaton has 289851 states and 395934 transitions. Word has length 79 [2024-10-12 20:28:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:28:05,468 INFO L471 AbstractCegarLoop]: Abstraction has 289851 states and 395934 transitions. [2024-10-12 20:28:05,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 26 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 289851 states and 395934 transitions. [2024-10-12 20:28:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:28:05,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:28:05,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:28:05,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:28:05,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 20:28:05,680 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:28:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:28:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash -871275342, now seen corresponding path program 1 times [2024-10-12 20:28:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:28:05,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671035359] [2024-10-12 20:28:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:28:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:28:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671035359] [2024-10-12 20:28:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671035359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:28:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085519993] [2024-10-12 20:28:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:28:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:28:06,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:28:06,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:28:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:06,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 20:28:06,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:28:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:06,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:28:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085519993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:28:07,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:28:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2024-10-12 20:28:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035784251] [2024-10-12 20:28:07,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:28:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:28:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:28:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:28:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:28:07,347 INFO L87 Difference]: Start difference. First operand 289851 states and 395934 transitions. Second operand has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 26 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:28:17,095 INFO L93 Difference]: Finished difference Result 1742697 states and 2359115 transitions. [2024-10-12 20:28:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-10-12 20:28:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 26 states have internal predecessors, (203), 0 states have call successors, (0), 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 79 [2024-10-12 20:28:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:28:19,718 INFO L225 Difference]: With dead ends: 1742697 [2024-10-12 20:28:19,719 INFO L226 Difference]: Without dead ends: 1456891 [2024-10-12 20:28:21,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5732 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2558, Invalid=13954, Unknown=0, NotChecked=0, Total=16512 [2024-10-12 20:28:21,006 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 2532 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:28:21,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 1889 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:28:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456891 states. [2024-10-12 20:28:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456891 to 1000612. [2024-10-12 20:28:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000612 states, 1000611 states have (on average 1.3586788472243458) internal successors, (1359509), 1000611 states have internal predecessors, (1359509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000612 states to 1000612 states and 1359509 transitions. [2024-10-12 20:28:40,565 INFO L78 Accepts]: Start accepts. Automaton has 1000612 states and 1359509 transitions. Word has length 79 [2024-10-12 20:28:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:28:40,565 INFO L471 AbstractCegarLoop]: Abstraction has 1000612 states and 1359509 transitions. [2024-10-12 20:28:40,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 26 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1000612 states and 1359509 transitions. [2024-10-12 20:28:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:28:40,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:28:40,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:28:40,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:28:40,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:28:40,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:28:40,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:28:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1253024599, now seen corresponding path program 1 times [2024-10-12 20:28:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:28:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547159209] [2024-10-12 20:28:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:28:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:28:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547159209] [2024-10-12 20:28:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547159209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:28:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:28:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:28:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971663773] [2024-10-12 20:28:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:28:40,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:28:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:28:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:28:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:28:40,862 INFO L87 Difference]: Start difference. First operand 1000612 states and 1359509 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)