./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.3.ufo.UNBOUNDED.pals.c.v+nlh-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.3.ufo.UNBOUNDED.pals.c.v+nlh-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 74d57b3f1e9a386b0ff6bac396d798184771ae1b1b0bb917f750fc3ebefb1c2f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:27:08,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:27:09,069 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:09,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:27:09,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:27:09,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:27:09,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:27:09,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:27:09,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:27:09,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:27:09,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:27:09,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:27:09,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:27:09,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:27:09,127 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:27:09,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:27:09,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:27:09,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:27:09,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:27:09,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:27:09,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:27:09,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:27:09,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:27:09,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:27:09,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:27:09,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:27:09,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:27:09,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:27:09,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:27:09,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:27:09,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:27:09,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:27:09,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:27:09,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:27:09,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:27:09,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:27:09,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:27:09,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:27:09,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:27:09,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:27:09,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:27:09,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:27:09,139 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 -> 74d57b3f1e9a386b0ff6bac396d798184771ae1b1b0bb917f750fc3ebefb1c2f [2024-10-12 20:27:09,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:27:09,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:27:09,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:27:09,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:27:09,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:27:09,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:27:11,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:27:11,257 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:27:11,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:27:11,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984208f1b/e4b2075303fb4bf0908ded870e3e620b/FLAGbb817f1b4 [2024-10-12 20:27:11,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984208f1b/e4b2075303fb4bf0908ded870e3e620b [2024-10-12 20:27:11,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:27:11,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:27:11,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:27:11,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:27:11,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:27:11,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:27:11" (1/1) ... [2024-10-12 20:27:11,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef92c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:11, skipping insertion in model container [2024-10-12 20:27:11,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:27:11" (1/1) ... [2024-10-12 20:27:11,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:27:11,585 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6874,6887] [2024-10-12 20:27:11,606 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9049,9062] [2024-10-12 20:27:11,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:27:11,636 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:27:11,677 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6874,6887] [2024-10-12 20:27:11,685 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9049,9062] [2024-10-12 20:27:11,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:27:11,718 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:27:11,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:11 WrapperNode [2024-10-12 20:27:11,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:27:11,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:27:11,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:27:11,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:27:11,725 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:11" (1/1) ... [2024-10-12 20:27:11,733 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:11" (1/1) ... [2024-10-12 20:27:11,770 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 483 [2024-10-12 20:27:11,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:27:11,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:27:11,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:27:11,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:27:11,784 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:11" (1/1) ... [2024-10-12 20:27:11,785 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:11" (1/1) ... [2024-10-12 20:27:11,792 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:11" (1/1) ... [2024-10-12 20:27:11,815 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:11,815 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:11" (1/1) ... [2024-10-12 20:27:11,816 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:11" (1/1) ... [2024-10-12 20:27:11,823 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:11" (1/1) ... [2024-10-12 20:27:11,827 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:11" (1/1) ... [2024-10-12 20:27:11,829 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:11" (1/1) ... [2024-10-12 20:27:11,831 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:11" (1/1) ... [2024-10-12 20:27:11,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:27:11,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:27:11,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:27:11,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:27:11,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:11" (1/1) ... [2024-10-12 20:27:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:27:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:11,887 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:11,890 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:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:27:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:27:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:27:11,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:27:12,091 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:27:12,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:27:12,624 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-12 20:27:12,625 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:27:12,659 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:27:12,660 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:27:12,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:27:12 BoogieIcfgContainer [2024-10-12 20:27:12,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:27:12,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:27:12,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:27:12,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:27:12,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:27:11" (1/3) ... [2024-10-12 20:27:12,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107f8aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:27:12, skipping insertion in model container [2024-10-12 20:27:12,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:27:11" (2/3) ... [2024-10-12 20:27:12,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107f8aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:27:12, skipping insertion in model container [2024-10-12 20:27:12,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:27:12" (3/3) ... [2024-10-12 20:27:12,669 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:27:12,687 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:27:12,687 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:27:12,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:27:12,758 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;@49b17803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:27:12,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:27:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:27:12,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:12,774 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] [2024-10-12 20:27:12,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:12,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash -945003803, now seen corresponding path program 1 times [2024-10-12 20:27:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:12,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665517652] [2024-10-12 20:27:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:13,318 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:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665517652] [2024-10-12 20:27:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665517652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824218136] [2024-10-12 20:27:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:13,351 INFO L87 Difference]: Start difference. First operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:13,602 INFO L93 Difference]: Finished difference Result 414 states and 660 transitions. [2024-10-12 20:27:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:27:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-12 20:27:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:13,620 INFO L225 Difference]: With dead ends: 414 [2024-10-12 20:27:13,620 INFO L226 Difference]: Without dead ends: 357 [2024-10-12 20:27:13,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:27:13,626 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 591 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:13,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 749 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-12 20:27:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 155. [2024-10-12 20:27:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 154 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-10-12 20:27:13,686 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 46 [2024-10-12 20:27:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-10-12 20:27:13,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-10-12 20:27:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:27:13,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:13,689 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:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:27:13,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash 593093139, now seen corresponding path program 1 times [2024-10-12 20:27:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:13,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919665386] [2024-10-12 20:27:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:14,044 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:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919665386] [2024-10-12 20:27:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919665386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:14,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231672067] [2024-10-12 20:27:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:14,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:14,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:14,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:14,052 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:14,214 INFO L93 Difference]: Finished difference Result 246 states and 358 transitions. [2024-10-12 20:27:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:14,217 INFO L225 Difference]: With dead ends: 246 [2024-10-12 20:27:14,217 INFO L226 Difference]: Without dead ends: 159 [2024-10-12 20:27:14,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:14,219 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 247 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:14,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 355 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-12 20:27:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-10-12 20:27:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 156 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-10-12 20:27:14,229 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 47 [2024-10-12 20:27:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:14,229 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-10-12 20:27:14,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-10-12 20:27:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:27:14,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:14,231 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:14,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:27:14,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:14,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2018603644, now seen corresponding path program 1 times [2024-10-12 20:27:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:14,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783014670] [2024-10-12 20:27:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:14,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:14,375 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:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783014670] [2024-10-12 20:27:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783014670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498944536] [2024-10-12 20:27:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:14,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:14,381 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:14,491 INFO L93 Difference]: Finished difference Result 477 states and 706 transitions. [2024-10-12 20:27:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:14,494 INFO L225 Difference]: With dead ends: 477 [2024-10-12 20:27:14,495 INFO L226 Difference]: Without dead ends: 393 [2024-10-12 20:27:14,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:27:14,499 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 297 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:14,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 608 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-12 20:27:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 250. [2024-10-12 20:27:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.471774193548387) internal successors, (365), 249 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 365 transitions. [2024-10-12 20:27:14,527 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 365 transitions. Word has length 48 [2024-10-12 20:27:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 365 transitions. [2024-10-12 20:27:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 365 transitions. [2024-10-12 20:27:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:27:14,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:14,530 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:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:27:14,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:14,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 298259056, now seen corresponding path program 1 times [2024-10-12 20:27:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:14,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564014040] [2024-10-12 20:27:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:14,652 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:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564014040] [2024-10-12 20:27:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564014040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791659886] [2024-10-12 20:27:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:14,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:14,656 INFO L87 Difference]: Start difference. First operand 250 states and 365 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:14,759 INFO L93 Difference]: Finished difference Result 565 states and 841 transitions. [2024-10-12 20:27:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:14,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:14,762 INFO L225 Difference]: With dead ends: 565 [2024-10-12 20:27:14,762 INFO L226 Difference]: Without dead ends: 481 [2024-10-12 20:27:14,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:27:14,765 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 357 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:14,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 562 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-12 20:27:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 381. [2024-10-12 20:27:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 379 states have (on average 1.4907651715039578) internal successors, (565), 380 states have internal predecessors, (565), 0 states have call successors, (0), 0 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:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 565 transitions. [2024-10-12 20:27:14,787 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 565 transitions. Word has length 48 [2024-10-12 20:27:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:14,787 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 565 transitions. [2024-10-12 20:27:14,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 565 transitions. [2024-10-12 20:27:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:27:14,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:14,789 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:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:27:14,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash -310246692, now seen corresponding path program 1 times [2024-10-12 20:27:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740459599] [2024-10-12 20:27:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:14,924 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:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740459599] [2024-10-12 20:27:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740459599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:14,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:27:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283900227] [2024-10-12 20:27:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:14,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:14,927 INFO L87 Difference]: Start difference. First operand 381 states and 565 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:15,030 INFO L93 Difference]: Finished difference Result 658 states and 984 transitions. [2024-10-12 20:27:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:15,033 INFO L225 Difference]: With dead ends: 658 [2024-10-12 20:27:15,033 INFO L226 Difference]: Without dead ends: 574 [2024-10-12 20:27:15,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:27:15,038 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 360 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:15,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 579 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-12 20:27:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 474. [2024-10-12 20:27:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.5) internal successors, (708), 473 states have internal predecessors, (708), 0 states have call successors, (0), 0 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:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 708 transitions. [2024-10-12 20:27:15,053 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 708 transitions. Word has length 48 [2024-10-12 20:27:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 708 transitions. [2024-10-12 20:27:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 708 transitions. [2024-10-12 20:27:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:27:15,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:15,056 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:15,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:27:15,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1671236436, now seen corresponding path program 1 times [2024-10-12 20:27:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952792342] [2024-10-12 20:27:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:15,169 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:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952792342] [2024-10-12 20:27:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952792342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024434354] [2024-10-12 20:27:15,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:15,172 INFO L87 Difference]: Start difference. First operand 474 states and 708 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:15,270 INFO L93 Difference]: Finished difference Result 927 states and 1394 transitions. [2024-10-12 20:27:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:15,274 INFO L225 Difference]: With dead ends: 927 [2024-10-12 20:27:15,274 INFO L226 Difference]: Without dead ends: 474 [2024-10-12 20:27:15,275 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:15,277 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 384 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:15,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 80 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-12 20:27:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-10-12 20:27:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.478813559322034) internal successors, (698), 473 states have internal predecessors, (698), 0 states have call successors, (0), 0 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:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 698 transitions. [2024-10-12 20:27:15,289 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 698 transitions. Word has length 49 [2024-10-12 20:27:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:15,289 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 698 transitions. [2024-10-12 20:27:15,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 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:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 698 transitions. [2024-10-12 20:27:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:27:15,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:15,295 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:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:27:15,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1581382941, now seen corresponding path program 1 times [2024-10-12 20:27:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121637026] [2024-10-12 20:27:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:15,415 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:15,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121637026] [2024-10-12 20:27:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121637026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805317962] [2024-10-12 20:27:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:15,417 INFO L87 Difference]: Start difference. First operand 474 states and 698 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:15,516 INFO L93 Difference]: Finished difference Result 919 states and 1365 transitions. [2024-10-12 20:27:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:15,518 INFO L225 Difference]: With dead ends: 919 [2024-10-12 20:27:15,519 INFO L226 Difference]: Without dead ends: 474 [2024-10-12 20:27:15,519 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:15,520 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 355 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:15,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 96 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-12 20:27:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-10-12 20:27:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.4576271186440677) internal successors, (688), 473 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 688 transitions. [2024-10-12 20:27:15,531 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 688 transitions. Word has length 50 [2024-10-12 20:27:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:15,531 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 688 transitions. [2024-10-12 20:27:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 688 transitions. [2024-10-12 20:27:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:27:15,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:15,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:27:15,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:15,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash 815927604, now seen corresponding path program 1 times [2024-10-12 20:27:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187834050] [2024-10-12 20:27:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:15,634 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:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187834050] [2024-10-12 20:27:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187834050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:15,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:27:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094918192] [2024-10-12 20:27:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:27:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:27:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:27:15,637 INFO L87 Difference]: Start difference. First operand 474 states and 688 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:15,718 INFO L93 Difference]: Finished difference Result 923 states and 1350 transitions. [2024-10-12 20:27:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:27:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-12 20:27:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:15,721 INFO L225 Difference]: With dead ends: 923 [2024-10-12 20:27:15,721 INFO L226 Difference]: Without dead ends: 474 [2024-10-12 20:27:15,722 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:15,723 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 360 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:15,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 88 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:27:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-12 20:27:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-10-12 20:27:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.4364406779661016) internal successors, (678), 473 states have internal predecessors, (678), 0 states have call successors, (0), 0 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:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 678 transitions. [2024-10-12 20:27:15,732 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 678 transitions. Word has length 51 [2024-10-12 20:27:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:15,732 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 678 transitions. [2024-10-12 20:27:15,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 678 transitions. [2024-10-12 20:27:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:27:15,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:15,733 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:15,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:27:15,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1678337521, now seen corresponding path program 1 times [2024-10-12 20:27:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619730502] [2024-10-12 20:27:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:16,071 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:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619730502] [2024-10-12 20:27:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619730502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:27:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996640118] [2024-10-12 20:27:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:27:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:27:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:27:16,074 INFO L87 Difference]: Start difference. First operand 474 states and 678 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:16,381 INFO L93 Difference]: Finished difference Result 1285 states and 1862 transitions. [2024-10-12 20:27:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:27:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:16,385 INFO L225 Difference]: With dead ends: 1285 [2024-10-12 20:27:16,385 INFO L226 Difference]: Without dead ends: 872 [2024-10-12 20:27:16,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:27:16,388 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 510 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 332 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:27:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-10-12 20:27:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 474. [2024-10-12 20:27:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.4343220338983051) internal successors, (677), 473 states have internal predecessors, (677), 0 states have call successors, (0), 0 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:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 677 transitions. [2024-10-12 20:27:16,402 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 677 transitions. Word has length 52 [2024-10-12 20:27:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:16,403 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 677 transitions. [2024-10-12 20:27:16,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 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:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 677 transitions. [2024-10-12 20:27:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:27:16,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:16,404 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:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:27:16,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash -258879561, now seen corresponding path program 1 times [2024-10-12 20:27:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936226050] [2024-10-12 20:27:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:16,734 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:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936226050] [2024-10-12 20:27:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936226050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:27:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543642613] [2024-10-12 20:27:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:16,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:27:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:27:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:16,738 INFO L87 Difference]: Start difference. First operand 474 states and 677 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:17,215 INFO L93 Difference]: Finished difference Result 1313 states and 1895 transitions. [2024-10-12 20:27:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:27:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:17,219 INFO L225 Difference]: With dead ends: 1313 [2024-10-12 20:27:17,219 INFO L226 Difference]: Without dead ends: 905 [2024-10-12 20:27:17,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:27:17,220 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 398 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:17,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 735 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:27:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-12 20:27:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 474. [2024-10-12 20:27:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.430084745762712) internal successors, (675), 473 states have internal predecessors, (675), 0 states have call successors, (0), 0 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:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 675 transitions. [2024-10-12 20:27:17,234 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 675 transitions. Word has length 52 [2024-10-12 20:27:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 675 transitions. [2024-10-12 20:27:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 675 transitions. [2024-10-12 20:27:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:27:17,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:17,235 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:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:27:17,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 80191994, now seen corresponding path program 1 times [2024-10-12 20:27:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174321698] [2024-10-12 20:27:17,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:17,497 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:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174321698] [2024-10-12 20:27:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174321698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:27:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245654577] [2024-10-12 20:27:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:17,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:27:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:27:17,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:27:17,500 INFO L87 Difference]: Start difference. First operand 474 states and 675 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:17,949 INFO L93 Difference]: Finished difference Result 1298 states and 1869 transitions. [2024-10-12 20:27:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:27:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:17,953 INFO L225 Difference]: With dead ends: 1298 [2024-10-12 20:27:17,953 INFO L226 Difference]: Without dead ends: 900 [2024-10-12 20:27:17,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:27:17,955 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 527 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 401 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:27:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-10-12 20:27:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 474. [2024-10-12 20:27:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 472 states have (on average 1.4216101694915255) internal successors, (671), 473 states have internal predecessors, (671), 0 states have call successors, (0), 0 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:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 671 transitions. [2024-10-12 20:27:17,969 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 671 transitions. Word has length 53 [2024-10-12 20:27:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:17,969 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 671 transitions. [2024-10-12 20:27:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 671 transitions. [2024-10-12 20:27:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:27:17,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:17,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:27:17,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1921420051, now seen corresponding path program 1 times [2024-10-12 20:27:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:17,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672158971] [2024-10-12 20:27:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:18,669 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:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672158971] [2024-10-12 20:27:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672158971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-12 20:27:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616371526] [2024-10-12 20:27:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:18,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:27:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:27:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:27:18,671 INFO L87 Difference]: Start difference. First operand 474 states and 671 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:19,918 INFO L93 Difference]: Finished difference Result 2090 states and 3025 transitions. [2024-10-12 20:27:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:27:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:27:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:19,925 INFO L225 Difference]: With dead ends: 2090 [2024-10-12 20:27:19,925 INFO L226 Difference]: Without dead ends: 1692 [2024-10-12 20:27:19,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:27:19,927 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 574 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:19,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 2119 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:27:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2024-10-12 20:27:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 489. [2024-10-12 20:27:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 1.4127310061601643) internal successors, (688), 488 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 688 transitions. [2024-10-12 20:27:19,953 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 688 transitions. Word has length 54 [2024-10-12 20:27:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 688 transitions. [2024-10-12 20:27:19,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 688 transitions. [2024-10-12 20:27:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:27:19,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:19,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:19,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:27:19,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:19,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 772442825, now seen corresponding path program 1 times [2024-10-12 20:27:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070413244] [2024-10-12 20:27:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:20,486 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:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070413244] [2024-10-12 20:27:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070413244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:27:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242026141] [2024-10-12 20:27:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:27:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:27:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:27:20,488 INFO L87 Difference]: Start difference. First operand 489 states and 688 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:21,100 INFO L93 Difference]: Finished difference Result 1824 states and 2644 transitions. [2024-10-12 20:27:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:27:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:27:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:21,107 INFO L225 Difference]: With dead ends: 1824 [2024-10-12 20:27:21,107 INFO L226 Difference]: Without dead ends: 1628 [2024-10-12 20:27:21,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:27:21,111 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 660 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:21,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1483 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:27:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-10-12 20:27:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 468. [2024-10-12 20:27:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 466 states have (on average 1.4141630901287554) internal successors, (659), 467 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 659 transitions. [2024-10-12 20:27:21,132 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 659 transitions. Word has length 54 [2024-10-12 20:27:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:21,132 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 659 transitions. [2024-10-12 20:27:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 659 transitions. [2024-10-12 20:27:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:27:21,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:21,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:27:21,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:21,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1017185135, now seen corresponding path program 1 times [2024-10-12 20:27:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238377485] [2024-10-12 20:27:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:21,718 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:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238377485] [2024-10-12 20:27:21,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238377485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:21,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:21,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:27:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388104629] [2024-10-12 20:27:21,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:21,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:27:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:27:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:27:21,721 INFO L87 Difference]: Start difference. First operand 468 states and 659 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:22,339 INFO L93 Difference]: Finished difference Result 1028 states and 1479 transitions. [2024-10-12 20:27:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:27:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:27:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:22,342 INFO L225 Difference]: With dead ends: 1028 [2024-10-12 20:27:22,342 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 20:27:22,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:27:22,344 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 583 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:22,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 967 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:27:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 20:27:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 445. [2024-10-12 20:27:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 443 states have (on average 1.419864559819413) internal successors, (629), 444 states have internal predecessors, (629), 0 states have call successors, (0), 0 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:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2024-10-12 20:27:22,356 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 55 [2024-10-12 20:27:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:22,356 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2024-10-12 20:27:22,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2024-10-12 20:27:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:27:22,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:22,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:22,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:27:22,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:22,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1760940237, now seen corresponding path program 1 times [2024-10-12 20:27:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555913014] [2024-10-12 20:27:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:23,338 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:23,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:23,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555913014] [2024-10-12 20:27:23,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555913014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:23,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:23,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:27:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039087377] [2024-10-12 20:27:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:23,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:27:23,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:27:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:27:23,340 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:24,723 INFO L93 Difference]: Finished difference Result 1394 states and 2020 transitions. [2024-10-12 20:27:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 20:27:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:27:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:24,727 INFO L225 Difference]: With dead ends: 1394 [2024-10-12 20:27:24,728 INFO L226 Difference]: Without dead ends: 1219 [2024-10-12 20:27:24,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 20:27:24,730 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 769 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:24,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1282 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:27:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-12 20:27:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 450. [2024-10-12 20:27:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 448 states have (on average 1.4174107142857142) internal successors, (635), 449 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 635 transitions. [2024-10-12 20:27:24,757 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 635 transitions. Word has length 55 [2024-10-12 20:27:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 635 transitions. [2024-10-12 20:27:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 635 transitions. [2024-10-12 20:27:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:27:24,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:24,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:27:24,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:24,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -677100116, now seen corresponding path program 1 times [2024-10-12 20:27:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891439433] [2024-10-12 20:27:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:25,251 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:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891439433] [2024-10-12 20:27:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891439433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:25,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:27:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10068304] [2024-10-12 20:27:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:27:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:27:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:27:25,255 INFO L87 Difference]: Start difference. First operand 450 states and 635 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:25,931 INFO L93 Difference]: Finished difference Result 999 states and 1445 transitions. [2024-10-12 20:27:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:27:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 20:27:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:25,935 INFO L225 Difference]: With dead ends: 999 [2024-10-12 20:27:25,935 INFO L226 Difference]: Without dead ends: 824 [2024-10-12 20:27:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:27:25,937 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 587 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 724 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:27:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-12 20:27:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 435. [2024-10-12 20:27:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.423963133640553) internal successors, (618), 434 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 618 transitions. [2024-10-12 20:27:25,952 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 618 transitions. Word has length 55 [2024-10-12 20:27:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:25,953 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 618 transitions. [2024-10-12 20:27:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 618 transitions. [2024-10-12 20:27:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:27:25,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:25,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:27:25,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 771114546, now seen corresponding path program 1 times [2024-10-12 20:27:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379821180] [2024-10-12 20:27:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:26,013 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:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379821180] [2024-10-12 20:27:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379821180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963825579] [2024-10-12 20:27:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:26,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:26,017 INFO L87 Difference]: Start difference. First operand 435 states and 618 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:26,043 INFO L93 Difference]: Finished difference Result 1119 states and 1621 transitions. [2024-10-12 20:27:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:26,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-12 20:27:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:26,046 INFO L225 Difference]: With dead ends: 1119 [2024-10-12 20:27:26,046 INFO L226 Difference]: Without dead ends: 748 [2024-10-12 20:27:26,046 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:26,047 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:26,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 187 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-12 20:27:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 737. [2024-10-12 20:27:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.4103260869565217) internal successors, (1038), 736 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1038 transitions. [2024-10-12 20:27:26,060 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1038 transitions. Word has length 75 [2024-10-12 20:27:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:26,061 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1038 transitions. [2024-10-12 20:27:26,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1038 transitions. [2024-10-12 20:27:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:27:26,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:26,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:26,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:27:26,062 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1383439819, now seen corresponding path program 1 times [2024-10-12 20:27:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716863074] [2024-10-12 20:27:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:26,149 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:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716863074] [2024-10-12 20:27:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716863074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206788453] [2024-10-12 20:27:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:26,152 INFO L87 Difference]: Start difference. First operand 737 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:26,172 INFO L93 Difference]: Finished difference Result 2011 states and 2852 transitions. [2024-10-12 20:27:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:26,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-12 20:27:26,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:26,177 INFO L225 Difference]: With dead ends: 2011 [2024-10-12 20:27:26,177 INFO L226 Difference]: Without dead ends: 1338 [2024-10-12 20:27:26,178 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:26,179 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:26,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-10-12 20:27:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1264. [2024-10-12 20:27:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.4038004750593824) internal successors, (1773), 1263 states have internal predecessors, (1773), 0 states have call successors, (0), 0 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:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1773 transitions. [2024-10-12 20:27:26,201 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1773 transitions. Word has length 76 [2024-10-12 20:27:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:26,201 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1773 transitions. [2024-10-12 20:27:26,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1773 transitions. [2024-10-12 20:27:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:27:26,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:26,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, 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:26,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:27:26,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:26,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -132415023, now seen corresponding path program 1 times [2024-10-12 20:27:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372510198] [2024-10-12 20:27:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:26,308 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:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372510198] [2024-10-12 20:27:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372510198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:26,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:26,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44000213] [2024-10-12 20:27:26,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:26,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:26,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:26,310 INFO L87 Difference]: Start difference. First operand 1264 states and 1773 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:26,333 INFO L93 Difference]: Finished difference Result 3520 states and 4931 transitions. [2024-10-12 20:27:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-12 20:27:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:26,340 INFO L225 Difference]: With dead ends: 3520 [2024-10-12 20:27:26,340 INFO L226 Difference]: Without dead ends: 2320 [2024-10-12 20:27:26,342 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:26,343 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:26,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2024-10-12 20:27:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2174. [2024-10-12 20:27:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2173 states have (on average 1.3847215830648874) internal successors, (3009), 2173 states have internal predecessors, (3009), 0 states have call successors, (0), 0 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:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3009 transitions. [2024-10-12 20:27:26,407 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3009 transitions. Word has length 77 [2024-10-12 20:27:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:26,407 INFO L471 AbstractCegarLoop]: Abstraction has 2174 states and 3009 transitions. [2024-10-12 20:27:26,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:27:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3009 transitions. [2024-10-12 20:27:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:27:26,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:26,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:26,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:27:26,410 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash 343334696, now seen corresponding path program 1 times [2024-10-12 20:27:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156786148] [2024-10-12 20:27:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:26,620 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:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156786148] [2024-10-12 20:27:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156786148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:27:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570322639] [2024-10-12 20:27:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:27:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:27:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:26,623 INFO L87 Difference]: Start difference. First operand 2174 states and 3009 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:26,652 INFO L93 Difference]: Finished difference Result 2272 states and 3138 transitions. [2024-10-12 20:27:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:27:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:26,660 INFO L225 Difference]: With dead ends: 2272 [2024-10-12 20:27:26,660 INFO L226 Difference]: Without dead ends: 2270 [2024-10-12 20:27:26,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:27:26,662 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:26,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2024-10-12 20:27:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2270. [2024-10-12 20:27:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2269 states have (on average 1.359629792860291) internal successors, (3085), 2269 states have internal predecessors, (3085), 0 states have call successors, (0), 0 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:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3085 transitions. [2024-10-12 20:27:26,699 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3085 transitions. Word has length 78 [2024-10-12 20:27:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:26,699 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3085 transitions. [2024-10-12 20:27:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3085 transitions. [2024-10-12 20:27:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:27:26,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:26,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:26,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:27:26,700 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:26,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 198534444, now seen corresponding path program 1 times [2024-10-12 20:27:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784830130] [2024-10-12 20:27:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:26,780 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:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784830130] [2024-10-12 20:27:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784830130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318985797] [2024-10-12 20:27:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:26,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:26,782 INFO L87 Difference]: Start difference. First operand 2270 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:26,808 INFO L93 Difference]: Finished difference Result 5890 states and 7999 transitions. [2024-10-12 20:27:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:26,819 INFO L225 Difference]: With dead ends: 5890 [2024-10-12 20:27:26,819 INFO L226 Difference]: Without dead ends: 3684 [2024-10-12 20:27:26,822 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:26,823 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:26,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2024-10-12 20:27:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3394. [2024-10-12 20:27:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3393 states have (on average 1.34070144414972) internal successors, (4549), 3393 states have internal predecessors, (4549), 0 states have call successors, (0), 0 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:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4549 transitions. [2024-10-12 20:27:26,925 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4549 transitions. Word has length 79 [2024-10-12 20:27:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:26,926 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4549 transitions. [2024-10-12 20:27:26,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4549 transitions. [2024-10-12 20:27:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:27:26,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:26,927 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:27:26,928 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1558547986, now seen corresponding path program 1 times [2024-10-12 20:27:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691788918] [2024-10-12 20:27:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691788918] [2024-10-12 20:27:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691788918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:27:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:27:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:27:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814488558] [2024-10-12 20:27:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:27:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:27:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:27:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:27:27,021 INFO L87 Difference]: Start difference. First operand 3394 states and 4549 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:27,050 INFO L93 Difference]: Finished difference Result 6726 states and 9031 transitions. [2024-10-12 20:27:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:27:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:27:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:27,062 INFO L225 Difference]: With dead ends: 6726 [2024-10-12 20:27:27,062 INFO L226 Difference]: Without dead ends: 3396 [2024-10-12 20:27:27,066 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:27,068 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 57 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:27,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:27:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2024-10-12 20:27:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3394. [2024-10-12 20:27:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3393 states have (on average 1.3194812849985265) internal successors, (4477), 3393 states have internal predecessors, (4477), 0 states have call successors, (0), 0 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:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4477 transitions. [2024-10-12 20:27:27,128 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4477 transitions. Word has length 100 [2024-10-12 20:27:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:27,129 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4477 transitions. [2024-10-12 20:27:27,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4477 transitions. [2024-10-12 20:27:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:27:27,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:27,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:27:27,131 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -742776548, now seen corresponding path program 1 times [2024-10-12 20:27:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54904448] [2024-10-12 20:27:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54904448] [2024-10-12 20:27:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54904448] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:27:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786452302] [2024-10-12 20:27:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:27,877 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:27,879 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:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:28,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 20:27:28,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:29,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786452302] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:30,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 38 [2024-10-12 20:27:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950140544] [2024-10-12 20:27:30,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-12 20:27:30,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 20:27:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2024-10-12 20:27:30,641 INFO L87 Difference]: Start difference. First operand 3394 states and 4477 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:27:47,731 INFO L93 Difference]: Finished difference Result 46351 states and 60612 transitions. [2024-10-12 20:27:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 266 states. [2024-10-12 20:27:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:27:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:27:47,817 INFO L225 Difference]: With dead ends: 46351 [2024-10-12 20:27:47,817 INFO L226 Difference]: Without dead ends: 43021 [2024-10-12 20:27:47,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35079 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=9138, Invalid=81764, Unknown=0, NotChecked=0, Total=90902 [2024-10-12 20:27:47,844 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 4604 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 6187 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4604 SdHoareTripleChecker+Valid, 4765 SdHoareTripleChecker+Invalid, 6327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 6187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:27:47,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4604 Valid, 4765 Invalid, 6327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 6187 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 20:27:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43021 states. [2024-10-12 20:27:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43021 to 19393. [2024-10-12 20:27:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19393 states, 19392 states have (on average 1.31440800330033) internal successors, (25489), 19392 states have internal predecessors, (25489), 0 states have call successors, (0), 0 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:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19393 states to 19393 states and 25489 transitions. [2024-10-12 20:27:48,409 INFO L78 Accepts]: Start accepts. Automaton has 19393 states and 25489 transitions. Word has length 100 [2024-10-12 20:27:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:27:48,409 INFO L471 AbstractCegarLoop]: Abstraction has 19393 states and 25489 transitions. [2024-10-12 20:27:48,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19393 states and 25489 transitions. [2024-10-12 20:27:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:27:48,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:27:48,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:27:48,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:27:48,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 20:27:48,615 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:27:48,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:27:48,615 INFO L85 PathProgramCache]: Analyzing trace with hash 253587227, now seen corresponding path program 1 times [2024-10-12 20:27:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:27:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895016828] [2024-10-12 20:27:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:27:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:27:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895016828] [2024-10-12 20:27:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895016828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:27:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051227864] [2024-10-12 20:27:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:27:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:27:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:27:48,916 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:48,917 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:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:27:49,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 20:27:49,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:51,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:54,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051227864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:54,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:54,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 17] total 40 [2024-10-12 20:27:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371690615] [2024-10-12 20:27:54,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:54,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-12 20:27:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:54,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 20:27:54,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 20:27:54,469 INFO L87 Difference]: Start difference. First operand 19393 states and 25489 transitions. Second operand has 41 states, 41 states have (on average 6.634146341463414) internal successors, (272), 40 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:28:12,084 INFO L93 Difference]: Finished difference Result 90802 states and 119265 transitions. [2024-10-12 20:28:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2024-10-12 20:28:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.634146341463414) internal successors, (272), 40 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:28:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:28:12,249 INFO L225 Difference]: With dead ends: 90802 [2024-10-12 20:28:12,249 INFO L226 Difference]: Without dead ends: 87472 [2024-10-12 20:28:12,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27885 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=8239, Invalid=68767, Unknown=0, NotChecked=0, Total=77006 [2024-10-12 20:28:12,277 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 4518 mSDsluCounter, 5401 mSDsCounter, 0 mSdLazyCounter, 8994 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 5691 SdHoareTripleChecker+Invalid, 9051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:28:12,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 5691 Invalid, 9051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 8994 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-12 20:28:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87472 states. [2024-10-12 20:28:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87472 to 28560. [2024-10-12 20:28:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28560 states, 28559 states have (on average 1.310199936972583) internal successors, (37418), 28559 states have internal predecessors, (37418), 0 states have call successors, (0), 0 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:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28560 states to 28560 states and 37418 transitions. [2024-10-12 20:28:13,375 INFO L78 Accepts]: Start accepts. Automaton has 28560 states and 37418 transitions. Word has length 100 [2024-10-12 20:28:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:28:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 28560 states and 37418 transitions. [2024-10-12 20:28:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.634146341463414) internal successors, (272), 40 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28560 states and 37418 transitions. [2024-10-12 20:28:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:28:13,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:28:13,385 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, 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:13,404 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:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-12 20:28:13,586 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:28:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:28:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 494063031, now seen corresponding path program 1 times [2024-10-12 20:28:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:28:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979995202] [2024-10-12 20:28:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:28:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:14,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:28:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979995202] [2024-10-12 20:28:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979995202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:28:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987186512] [2024-10-12 20:28:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:28:14,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:28:14,396 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:14,397 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:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:14,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 20:28:14,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:28:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:15,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:28:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987186512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:28:16,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:28:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 47 [2024-10-12 20:28:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324347501] [2024-10-12 20:28:16,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:28:16,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-12 20:28:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:28:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-12 20:28:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1987, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 20:28:16,304 INFO L87 Difference]: Start difference. First operand 28560 states and 37418 transitions. Second operand has 47 states, 47 states have (on average 6.1063829787234045) internal successors, (287), 47 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:28:22,190 INFO L93 Difference]: Finished difference Result 78400 states and 103057 transitions. [2024-10-12 20:28:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-12 20:28:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.1063829787234045) internal successors, (287), 47 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-12 20:28:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:28:22,265 INFO L225 Difference]: With dead ends: 78400 [2024-10-12 20:28:22,265 INFO L226 Difference]: Without dead ends: 59092 [2024-10-12 20:28:22,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2600, Invalid=15222, Unknown=0, NotChecked=0, Total=17822 [2024-10-12 20:28:22,295 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 3064 mSDsluCounter, 6378 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 6599 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:28:22,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 6599 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:28:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59092 states. [2024-10-12 20:28:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59092 to 33476. [2024-10-12 20:28:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33476 states, 33475 states have (on average 1.3101120238984316) internal successors, (43856), 33475 states have internal predecessors, (43856), 0 states have call successors, (0), 0 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:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 43856 transitions. [2024-10-12 20:28:22,831 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 43856 transitions. Word has length 101 [2024-10-12 20:28:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:28:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 33476 states and 43856 transitions. [2024-10-12 20:28:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.1063829787234045) internal successors, (287), 47 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:28:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 43856 transitions. [2024-10-12 20:28:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:28:22,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:28:22,841 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, 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:22,861 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:23,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:28:23,043 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:28:23,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:28:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1517685212, now seen corresponding path program 1 times [2024-10-12 20:28:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:28:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004579335] [2024-10-12 20:28:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:28:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:28:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004579335] [2024-10-12 20:28:23,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004579335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:28:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909995985] [2024-10-12 20:28:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:28:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:28:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:28:23,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:28:23,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:28:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:28:23,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 20:28:23,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:28:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:24,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:28:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:28:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909995985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:28:25,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:28:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 33 [2024-10-12 20:28:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081525599] [2024-10-12 20:28:25,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:28:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-12 20:28:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:28:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-12 20:28:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:28:25,042 INFO L87 Difference]: Start difference. First operand 33476 states and 43856 transitions. Second operand has 33 states, 33 states have (on average 8.393939393939394) internal successors, (277), 33 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)