./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/pals_lcr.3.1.ufo.UNBOUNDED.pals.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/pals_lcr.3.1.ufo.UNBOUNDED.pals.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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:03:49,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:03:49,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:03:49,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:03:49,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:03:49,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:03:49,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:03:49,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:03:49,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:03:49,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:03:49,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:03:49,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:03:49,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:03:49,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:03:49,499 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:03:49,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:03:49,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:03:49,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:03:49,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:03:49,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:03:49,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:03:49,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:03:49,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:03:49,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:03:49,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:03:49,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:03:49,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:03:49,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:03:49,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:03:49,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:03:49,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:03:49,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:03:49,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:03:49,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:03:49,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:03:49,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:03:49,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:03:49,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:03:49,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:03:49,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:03:49,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:03:49,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:03:49,509 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2024-10-12 20:03:49,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:03:49,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:03:49,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:03:49,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:03:49,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:03:49,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:03:51,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:03:51,332 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:03:51,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:03:51,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e69233be/d8732956c98742958f7340da56088d77/FLAG84978a10e [2024-10-12 20:03:51,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e69233be/d8732956c98742958f7340da56088d77 [2024-10-12 20:03:51,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:03:51,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:03:51,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:03:51,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:03:51,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:03:51,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:03:51" (1/1) ... [2024-10-12 20:03:51,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e358edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:51, skipping insertion in model container [2024-10-12 20:03:51,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:03:51" (1/1) ... [2024-10-12 20:03:51,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:03:51,987 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/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-10-12 20:03:51,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:03:52,004 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:03:52,068 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/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-10-12 20:03:52,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:03:52,109 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:03:52,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52 WrapperNode [2024-10-12 20:03:52,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:03:52,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:03:52,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:03:52,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:03:52,120 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:03:52" (1/1) ... [2024-10-12 20:03:52,131 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:03:52" (1/1) ... [2024-10-12 20:03:52,161 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 223 [2024-10-12 20:03:52,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:03:52,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:03:52,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:03:52,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:03:52,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,187 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:03:52,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:03:52,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:03:52,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:03:52,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:03:52,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (1/1) ... [2024-10-12 20:03:52,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:03:52,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:52,249 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:03:52,253 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:03:52,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:03:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:03:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:03:52,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:03:52,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:03:52,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:03:52,718 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-12 20:03:52,722 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:03:52,767 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:03:52,768 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:03:52,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:03:52 BoogieIcfgContainer [2024-10-12 20:03:52,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:03:52,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:03:52,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:03:52,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:03:52,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:03:51" (1/3) ... [2024-10-12 20:03:52,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9d6682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:03:52, skipping insertion in model container [2024-10-12 20:03:52,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:03:52" (2/3) ... [2024-10-12 20:03:52,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9d6682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:03:52, skipping insertion in model container [2024-10-12 20:03:52,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:03:52" (3/3) ... [2024-10-12 20:03:52,779 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-10-12 20:03:52,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:03:52,797 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:03:52,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:03:52,871 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;@27f90263, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:03:52,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:03:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:03:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 20:03:52,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:52,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:52,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1356555257, now seen corresponding path program 1 times [2024-10-12 20:03:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:52,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598722042] [2024-10-12 20:03:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:53,104 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:03:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598722042] [2024-10-12 20:03:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598722042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:03:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853225208] [2024-10-12 20:03:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:03:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:03:53,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:03:53,144 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:03:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:53,169 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2024-10-12 20:03:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:03:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-12 20:03:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:53,182 INFO L225 Difference]: With dead ends: 85 [2024-10-12 20:03:53,182 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 20:03:53,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:03:53,187 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:53,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 20:03:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-12 20:03:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2024-10-12 20:03:53,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 16 [2024-10-12 20:03:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:53,225 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2024-10-12 20:03:53,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:03:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2024-10-12 20:03:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 20:03:53,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:53,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:53,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:03:53,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 769749243, now seen corresponding path program 1 times [2024-10-12 20:03:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511699405] [2024-10-12 20:03:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:53,422 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:03:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511699405] [2024-10-12 20:03:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511699405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:03:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550953238] [2024-10-12 20:03:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:53,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:03:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:03:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:53,427 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:03:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:53,495 INFO L93 Difference]: Finished difference Result 85 states and 137 transitions. [2024-10-12 20:03:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:03:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-12 20:03:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:53,497 INFO L225 Difference]: With dead ends: 85 [2024-10-12 20:03:53,497 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 20:03:53,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:53,498 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:53,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 20:03:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-12 20:03:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-10-12 20:03:53,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 16 [2024-10-12 20:03:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:53,512 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-10-12 20:03:53,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:03:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-10-12 20:03:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 20:03:53,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:53,513 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] [2024-10-12 20:03:53,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:03:53,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 84756620, now seen corresponding path program 1 times [2024-10-12 20:03:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:53,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89577075] [2024-10-12 20:03:53,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:53,711 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:03:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89577075] [2024-10-12 20:03:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89577075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110687537] [2024-10-12 20:03:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:53,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:53,717 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:03:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:53,890 INFO L93 Difference]: Finished difference Result 237 states and 363 transitions. [2024-10-12 20:03:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:03:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-12 20:03:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:53,894 INFO L225 Difference]: With dead ends: 237 [2024-10-12 20:03:53,894 INFO L226 Difference]: Without dead ends: 206 [2024-10-12 20:03:53,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:03:53,898 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 318 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:53,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 332 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-12 20:03:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 80. [2024-10-12 20:03:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 79 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:03:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-10-12 20:03:53,933 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 31 [2024-10-12 20:03:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:53,934 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-10-12 20:03:53,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:03:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-10-12 20:03:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 20:03:53,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:53,935 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] [2024-10-12 20:03:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:03:53,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -912973924, now seen corresponding path program 1 times [2024-10-12 20:03:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635036709] [2024-10-12 20:03:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,050 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:03:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635036709] [2024-10-12 20:03:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635036709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080612261] [2024-10-12 20:03:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:54,053 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:03:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,098 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2024-10-12 20:03:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-12 20:03:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,099 INFO L225 Difference]: With dead ends: 189 [2024-10-12 20:03:54,099 INFO L226 Difference]: Without dead ends: 129 [2024-10-12 20:03:54,100 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:03:54,101 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:54,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 103 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-12 20:03:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-10-12 20:03:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:03:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-10-12 20:03:54,127 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 33 [2024-10-12 20:03:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,127 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-10-12 20:03:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:03:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-10-12 20:03:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 20:03:54,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,129 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] [2024-10-12 20:03:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:03:54,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -910828972, now seen corresponding path program 1 times [2024-10-12 20:03:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157157913] [2024-10-12 20:03:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,340 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:03:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157157913] [2024-10-12 20:03:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157157913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201156512] [2024-10-12 20:03:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:54,344 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:03:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,418 INFO L93 Difference]: Finished difference Result 232 states and 347 transitions. [2024-10-12 20:03:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-12 20:03:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,419 INFO L225 Difference]: With dead ends: 232 [2024-10-12 20:03:54,419 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 20:03:54,421 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:03:54,422 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:54,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 150 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 20:03:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-12 20:03:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 124 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:03:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-10-12 20:03:54,442 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 33 [2024-10-12 20:03:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,443 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-10-12 20:03:54,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:03:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-10-12 20:03:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 20:03:54,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,447 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] [2024-10-12 20:03:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:03:54,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1815029063, now seen corresponding path program 1 times [2024-10-12 20:03:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179921230] [2024-10-12 20:03:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,598 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:03:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179921230] [2024-10-12 20:03:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179921230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:03:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226211661] [2024-10-12 20:03:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:03:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:03:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:54,603 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:03:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,631 INFO L93 Difference]: Finished difference Result 131 states and 188 transitions. [2024-10-12 20:03:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:03:54,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-12 20:03:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,633 INFO L225 Difference]: With dead ends: 131 [2024-10-12 20:03:54,635 INFO L226 Difference]: Without dead ends: 129 [2024-10-12 20:03:54,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:03:54,636 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:54,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-12 20:03:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-12 20:03:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4375) internal successors, (184), 128 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:03:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 184 transitions. [2024-10-12 20:03:54,652 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 184 transitions. Word has length 34 [2024-10-12 20:03:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,653 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 184 transitions. [2024-10-12 20:03:54,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:03:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 184 transitions. [2024-10-12 20:03:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 20:03:54,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,654 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] [2024-10-12 20:03:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:03:54,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1381419564, now seen corresponding path program 1 times [2024-10-12 20:03:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660928385] [2024-10-12 20:03:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,722 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:03:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660928385] [2024-10-12 20:03:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660928385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484794396] [2024-10-12 20:03:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:54,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:54,725 INFO L87 Difference]: Start difference. First operand 129 states and 184 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:03:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,743 INFO L93 Difference]: Finished difference Result 331 states and 484 transitions. [2024-10-12 20:03:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 20:03:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,748 INFO L225 Difference]: With dead ends: 331 [2024-10-12 20:03:54,748 INFO L226 Difference]: Without dead ends: 222 [2024-10-12 20:03:54,749 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:03:54,749 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 144 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:03:54,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-12 20:03:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-10-12 20:03:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.4383561643835616) internal successors, (315), 219 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:03:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2024-10-12 20:03:54,770 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 35 [2024-10-12 20:03:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,770 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2024-10-12 20:03:54,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:03:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2024-10-12 20:03:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 20:03:54,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,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] [2024-10-12 20:03:54,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:03:54,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash -492686124, now seen corresponding path program 1 times [2024-10-12 20:03:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158971047] [2024-10-12 20:03:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,824 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:03:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158971047] [2024-10-12 20:03:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158971047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226328358] [2024-10-12 20:03:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:54,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:54,826 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:03:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,851 INFO L93 Difference]: Finished difference Result 588 states and 849 transitions. [2024-10-12 20:03:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 20:03:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,853 INFO L225 Difference]: With dead ends: 588 [2024-10-12 20:03:54,854 INFO L226 Difference]: Without dead ends: 388 [2024-10-12 20:03:54,855 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:03:54,857 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 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:03:54,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-12 20:03:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-10-12 20:03:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4155844155844155) internal successors, (545), 385 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:03:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 545 transitions. [2024-10-12 20:03:54,870 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 545 transitions. Word has length 35 [2024-10-12 20:03:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 545 transitions. [2024-10-12 20:03:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:03:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 545 transitions. [2024-10-12 20:03:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 20:03:54,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,873 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] [2024-10-12 20:03:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:03:54,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1137438489, now seen corresponding path program 1 times [2024-10-12 20:03:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710524443] [2024-10-12 20:03:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:54,930 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:03:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710524443] [2024-10-12 20:03:54,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710524443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:54,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:54,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17555819] [2024-10-12 20:03:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:54,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:54,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:54,934 INFO L87 Difference]: Start difference. First operand 386 states and 545 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:03:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:54,964 INFO L93 Difference]: Finished difference Result 777 states and 1119 transitions. [2024-10-12 20:03:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-12 20:03:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:54,967 INFO L225 Difference]: With dead ends: 777 [2024-10-12 20:03:54,967 INFO L226 Difference]: Without dead ends: 558 [2024-10-12 20:03:54,968 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:03:54,969 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 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:03:54,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-12 20:03:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 556. [2024-10-12 20:03:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4108108108108108) internal successors, (783), 555 states have internal predecessors, (783), 0 states have call successors, (0), 0 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:03:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 783 transitions. [2024-10-12 20:03:54,992 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 783 transitions. Word has length 37 [2024-10-12 20:03:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 783 transitions. [2024-10-12 20:03:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:03:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 783 transitions. [2024-10-12 20:03:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:03:54,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:54,994 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] [2024-10-12 20:03:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:03:54,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 124429978, now seen corresponding path program 1 times [2024-10-12 20:03:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845780228] [2024-10-12 20:03:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:03:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845780228] [2024-10-12 20:03:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845780228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637477379] [2024-10-12 20:03:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:55,092 INFO L87 Difference]: Start difference. First operand 556 states and 783 transitions. 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:03:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:55,209 INFO L93 Difference]: Finished difference Result 2280 states and 3231 transitions. [2024-10-12 20:03:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:55,210 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 49 [2024-10-12 20:03:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:55,217 INFO L225 Difference]: With dead ends: 2280 [2024-10-12 20:03:55,217 INFO L226 Difference]: Without dead ends: 1746 [2024-10-12 20:03:55,219 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:03:55,220 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 172 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:55,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-10-12 20:03:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1088. [2024-10-12 20:03:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.408463661453542) internal successors, (1531), 1087 states have internal predecessors, (1531), 0 states have call successors, (0), 0 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:03:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1531 transitions. [2024-10-12 20:03:55,277 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1531 transitions. Word has length 49 [2024-10-12 20:03:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1531 transitions. [2024-10-12 20:03:55,278 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:03:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1531 transitions. [2024-10-12 20:03:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:03:55,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:55,279 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] [2024-10-12 20:03:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:03:55,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1013163418, now seen corresponding path program 1 times [2024-10-12 20:03:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013967306] [2024-10-12 20:03:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:03:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013967306] [2024-10-12 20:03:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013967306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387999774] [2024-10-12 20:03:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:55,412 INFO L87 Difference]: Start difference. First operand 1088 states and 1531 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:03:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:55,536 INFO L93 Difference]: Finished difference Result 2812 states and 3979 transitions. [2024-10-12 20:03:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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:03:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:55,546 INFO L225 Difference]: With dead ends: 2812 [2024-10-12 20:03:55,546 INFO L226 Difference]: Without dead ends: 2278 [2024-10-12 20:03:55,547 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:03:55,548 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 173 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:55,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 262 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2024-10-12 20:03:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1888. [2024-10-12 20:03:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.4006359300476947) internal successors, (2643), 1887 states have internal predecessors, (2643), 0 states have call successors, (0), 0 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:03:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2643 transitions. [2024-10-12 20:03:55,608 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2643 transitions. Word has length 49 [2024-10-12 20:03:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:55,608 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2643 transitions. [2024-10-12 20:03:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:03:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2643 transitions. [2024-10-12 20:03:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:03:55,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:55,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:55,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:03:55,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:55,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1439437598, now seen corresponding path program 1 times [2024-10-12 20:03:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46160799] [2024-10-12 20:03:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46160799] [2024-10-12 20:03:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46160799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054132658] [2024-10-12 20:03:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:55,742 INFO L87 Difference]: Start difference. First operand 1888 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:03:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:55,789 INFO L93 Difference]: Finished difference Result 3251 states and 4593 transitions. [2024-10-12 20:03:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:03:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:55,796 INFO L225 Difference]: With dead ends: 3251 [2024-10-12 20:03:55,796 INFO L226 Difference]: Without dead ends: 1385 [2024-10-12 20:03:55,798 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:03:55,799 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 34 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:55,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 143 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-12 20:03:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1383. [2024-10-12 20:03:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.4052098408104197) internal successors, (1942), 1382 states have internal predecessors, (1942), 0 states have call successors, (0), 0 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:03:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1942 transitions. [2024-10-12 20:03:55,845 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1942 transitions. Word has length 51 [2024-10-12 20:03:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1942 transitions. [2024-10-12 20:03:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:03:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1942 transitions. [2024-10-12 20:03:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:03:55,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:55,847 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] [2024-10-12 20:03:55,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:03:55,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 854869599, now seen corresponding path program 1 times [2024-10-12 20:03:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239762] [2024-10-12 20:03:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239762] [2024-10-12 20:03:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:03:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182979429] [2024-10-12 20:03:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:03:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:03:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:03:55,942 INFO L87 Difference]: Start difference. First operand 1383 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:03:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:56,050 INFO L93 Difference]: Finished difference Result 2543 states and 3602 transitions. [2024-10-12 20:03:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:03:56,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 51 [2024-10-12 20:03:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:56,058 INFO L225 Difference]: With dead ends: 2543 [2024-10-12 20:03:56,058 INFO L226 Difference]: Without dead ends: 2157 [2024-10-12 20:03:56,060 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:03:56,060 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 167 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:56,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 286 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:03:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-10-12 20:03:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767. [2024-10-12 20:03:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1766 states have (on average 1.407701019252548) internal successors, (2486), 1766 states have internal predecessors, (2486), 0 states have call successors, (0), 0 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:03:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2486 transitions. [2024-10-12 20:03:56,119 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2486 transitions. Word has length 51 [2024-10-12 20:03:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:56,119 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2486 transitions. [2024-10-12 20:03:56,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:03:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2486 transitions. [2024-10-12 20:03:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:03:56,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:56,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:03:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:03:56,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1284392075, now seen corresponding path program 1 times [2024-10-12 20:03:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172170039] [2024-10-12 20:03:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:56,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172170039] [2024-10-12 20:03:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172170039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:56,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:56,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632449077] [2024-10-12 20:03:56,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:56,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:56,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:56,244 INFO L87 Difference]: Start difference. First operand 1767 states and 2486 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:56,280 INFO L93 Difference]: Finished difference Result 2635 states and 3712 transitions. [2024-10-12 20:03:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 20:03:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:56,284 INFO L225 Difference]: With dead ends: 2635 [2024-10-12 20:03:56,284 INFO L226 Difference]: Without dead ends: 905 [2024-10-12 20:03:56,286 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:03:56,287 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:56,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-12 20:03:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2024-10-12 20:03:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.3791574279379157) internal successors, (1244), 902 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:03:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1244 transitions. [2024-10-12 20:03:56,319 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1244 transitions. Word has length 52 [2024-10-12 20:03:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:56,320 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1244 transitions. [2024-10-12 20:03:56,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:03:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1244 transitions. [2024-10-12 20:03:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:03:56,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:56,321 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] [2024-10-12 20:03:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:03:56,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2034831399, now seen corresponding path program 1 times [2024-10-12 20:03:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145563711] [2024-10-12 20:03:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145563711] [2024-10-12 20:03:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145563711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:03:56,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:03:56,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:03:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851071861] [2024-10-12 20:03:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:03:56,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:03:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:03:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:03:56,412 INFO L87 Difference]: Start difference. First operand 903 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:03:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:03:56,441 INFO L93 Difference]: Finished difference Result 1339 states and 1849 transitions. [2024-10-12 20:03:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:03:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:03:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:03:56,443 INFO L225 Difference]: With dead ends: 1339 [2024-10-12 20:03:56,444 INFO L226 Difference]: Without dead ends: 473 [2024-10-12 20:03:56,444 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:03:56,445 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:03:56,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:03:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-12 20:03:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2024-10-12 20:03:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.3446808510638297) internal successors, (632), 470 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:03:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 632 transitions. [2024-10-12 20:03:56,463 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 632 transitions. Word has length 54 [2024-10-12 20:03:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:03:56,463 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 632 transitions. [2024-10-12 20:03:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:03:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 632 transitions. [2024-10-12 20:03:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 20:03:56,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:03:56,464 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] [2024-10-12 20:03:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:03:56,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:03:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:03:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1368007847, now seen corresponding path program 1 times [2024-10-12 20:03:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:03:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250849861] [2024-10-12 20:03:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:03:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:03:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:03:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250849861] [2024-10-12 20:03:58,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250849861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:03:58,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218625467] [2024-10-12 20:03:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:03:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:03:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:03:58,306 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:03:58,313 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:03:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:03:58,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 20:03:58,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:03:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:58,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:03:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:03:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218625467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:03:58,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:03:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-12 20:03:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378314100] [2024-10-12 20:03:58,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:03:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 20:03:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:03:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 20:03:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:03:58,843 INFO L87 Difference]: Start difference. First operand 471 states and 632 transitions. Second operand has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:04:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:02,018 INFO L93 Difference]: Finished difference Result 2544 states and 3395 transitions. [2024-10-12 20:04:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 20:04:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 20:04:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:02,025 INFO L225 Difference]: With dead ends: 2544 [2024-10-12 20:04:02,025 INFO L226 Difference]: Without dead ends: 2110 [2024-10-12 20:04:02,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=596, Invalid=2596, Unknown=0, NotChecked=0, Total=3192 [2024-10-12 20:04:02,028 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 703 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:02,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 606 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:04:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2024-10-12 20:04:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2032. [2024-10-12 20:04:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 1.2693254554406697) internal successors, (2578), 2031 states have internal predecessors, (2578), 0 states have call successors, (0), 0 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:04:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2578 transitions. [2024-10-12 20:04:02,108 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2578 transitions. Word has length 56 [2024-10-12 20:04:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 2578 transitions. [2024-10-12 20:04:02,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.117647058823529) internal successors, (155), 17 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:04:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2578 transitions. [2024-10-12 20:04:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:04:02,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:02,110 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] [2024-10-12 20:04:02,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:02,310 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,SelfDestructingSolverStorable15 [2024-10-12 20:04:02,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:02,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1095679797, now seen corresponding path program 1 times [2024-10-12 20:04:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123311420] [2024-10-12 20:04:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123311420] [2024-10-12 20:04:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123311420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232753698] [2024-10-12 20:04:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:02,746 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:04:02,747 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:04:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:02,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:04:02,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:03,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232753698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:03,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-12 20:04:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670330559] [2024-10-12 20:04:03,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:04:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:04:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:04:03,760 INFO L87 Difference]: Start difference. First operand 2032 states and 2578 transitions. Second operand has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:04:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:04,179 INFO L93 Difference]: Finished difference Result 3421 states and 4376 transitions. [2024-10-12 20:04:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:04:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 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 57 [2024-10-12 20:04:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:04,187 INFO L225 Difference]: With dead ends: 3421 [2024-10-12 20:04:04,187 INFO L226 Difference]: Without dead ends: 2138 [2024-10-12 20:04:04,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:04:04,190 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 676 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:04,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 391 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:04:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2024-10-12 20:04:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2084. [2024-10-12 20:04:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.2592414786365818) internal successors, (2623), 2083 states have internal predecessors, (2623), 0 states have call successors, (0), 0 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:04:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2623 transitions. [2024-10-12 20:04:04,271 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2623 transitions. Word has length 57 [2024-10-12 20:04:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:04,271 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2623 transitions. [2024-10-12 20:04:04,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:04:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2623 transitions. [2024-10-12 20:04:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:04:04,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:04,272 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:04:04,290 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:04:04,476 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,SelfDestructingSolverStorable16 [2024-10-12 20:04:04,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -389389031, now seen corresponding path program 1 times [2024-10-12 20:04:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916322780] [2024-10-12 20:04:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916322780] [2024-10-12 20:04:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916322780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541909315] [2024-10-12 20:04:04,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:04,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:04,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:04,840 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:04:04,841 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:04:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:04,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 20:04:04,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:05,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541909315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:06,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2024-10-12 20:04:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974741394] [2024-10-12 20:04:06,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:06,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 20:04:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 20:04:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:04:06,280 INFO L87 Difference]: Start difference. First operand 2084 states and 2623 transitions. Second operand has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:04:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:06,920 INFO L93 Difference]: Finished difference Result 5872 states and 7447 transitions. [2024-10-12 20:04:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:04:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 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 57 [2024-10-12 20:04:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:06,933 INFO L225 Difference]: With dead ends: 5872 [2024-10-12 20:04:06,933 INFO L226 Difference]: Without dead ends: 4102 [2024-10-12 20:04:06,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=1255, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 20:04:06,937 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 469 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:06,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 548 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:04:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2024-10-12 20:04:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4030. [2024-10-12 20:04:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 4029 states have (on average 1.2412509307520476) internal successors, (5001), 4029 states have internal predecessors, (5001), 0 states have call successors, (0), 0 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:04:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5001 transitions. [2024-10-12 20:04:07,090 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5001 transitions. Word has length 57 [2024-10-12 20:04:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5001 transitions. [2024-10-12 20:04:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:04:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5001 transitions. [2024-10-12 20:04:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 20:04:07,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:07,091 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:04:07,108 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:04:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 20:04:07,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 351125273, now seen corresponding path program 1 times [2024-10-12 20:04:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643928883] [2024-10-12 20:04:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643928883] [2024-10-12 20:04:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643928883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252032874] [2024-10-12 20:04:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:07,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:07,565 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:04:07,566 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:04:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:07,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 20:04:07,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:10,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252032874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:12,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 17] total 39 [2024-10-12 20:04:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985955345] [2024-10-12 20:04:12,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:12,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-12 20:04:12,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 20:04:12,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1302, Unknown=0, NotChecked=0, Total=1482 [2024-10-12 20:04:12,230 INFO L87 Difference]: Start difference. First operand 4030 states and 5001 transitions. Second operand has 39 states, 39 states have (on average 3.923076923076923) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:04:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:28,148 INFO L93 Difference]: Finished difference Result 10689 states and 13496 transitions. [2024-10-12 20:04:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-10-12 20:04:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.923076923076923) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 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 57 [2024-10-12 20:04:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:28,169 INFO L225 Difference]: With dead ends: 10689 [2024-10-12 20:04:28,169 INFO L226 Difference]: Without dead ends: 6982 [2024-10-12 20:04:28,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8847 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=4677, Invalid=20445, Unknown=0, NotChecked=0, Total=25122 [2024-10-12 20:04:28,179 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 2507 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2507 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:28,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2507 Valid, 2031 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:04:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6982 states. [2024-10-12 20:04:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6982 to 6700. [2024-10-12 20:04:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.2546648753545304) internal successors, (8405), 6699 states have internal predecessors, (8405), 0 states have call successors, (0), 0 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:04:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 8405 transitions. [2024-10-12 20:04:28,465 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 8405 transitions. Word has length 57 [2024-10-12 20:04:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 8405 transitions. [2024-10-12 20:04:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.923076923076923) internal successors, (153), 39 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:04:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 8405 transitions. [2024-10-12 20:04:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 20:04:28,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:28,467 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] [2024-10-12 20:04:28,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:28,672 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:28,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1808659035, now seen corresponding path program 1 times [2024-10-12 20:04:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135602360] [2024-10-12 20:04:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135602360] [2024-10-12 20:04:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135602360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020559351] [2024-10-12 20:04:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:29,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:29,756 INFO L229 MonitoredProcess]: Starting monitored process 6 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:04:29,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:04:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:29,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 20:04:29,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:30,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020559351] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:33,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 48 [2024-10-12 20:04:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123350031] [2024-10-12 20:04:33,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 20:04:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:33,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 20:04:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2132, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 20:04:33,025 INFO L87 Difference]: Start difference. First operand 6700 states and 8405 transitions. Second operand has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 48 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:04:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:49,248 INFO L93 Difference]: Finished difference Result 14961 states and 18848 transitions. [2024-10-12 20:04:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-12 20:04:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 48 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-12 20:04:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:49,270 INFO L225 Difference]: With dead ends: 14961 [2024-10-12 20:04:49,274 INFO L226 Difference]: Without dead ends: 10836 [2024-10-12 20:04:49,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5915 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=4190, Invalid=16402, Unknown=0, NotChecked=0, Total=20592 [2024-10-12 20:04:49,287 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2125 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:49,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 2450 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:04:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2024-10-12 20:04:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 4771. [2024-10-12 20:04:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4770 states have (on average 1.2639412997903563) internal successors, (6029), 4770 states have internal predecessors, (6029), 0 states have call successors, (0), 0 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:04:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6029 transitions. [2024-10-12 20:04:49,596 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6029 transitions. Word has length 59 [2024-10-12 20:04:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:49,596 INFO L471 AbstractCegarLoop]: Abstraction has 4771 states and 6029 transitions. [2024-10-12 20:04:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 48 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:04:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6029 transitions. [2024-10-12 20:04:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:04:49,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:49,598 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-12 20:04:49,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:49,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -795044466, now seen corresponding path program 1 times [2024-10-12 20:04:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394329933] [2024-10-12 20:04:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 27 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394329933] [2024-10-12 20:04:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394329933] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247117194] [2024-10-12 20:04:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:50,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:50,522 INFO L229 MonitoredProcess]: Starting monitored process 7 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:04:50,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:04:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:50,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 20:04:50,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:51,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 27 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247117194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:52,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:52,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2024-10-12 20:04:52,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081810193] [2024-10-12 20:04:52,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:52,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 20:04:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 20:04:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2024-10-12 20:04:52,395 INFO L87 Difference]: Start difference. First operand 4771 states and 6029 transitions. Second operand has 30 states, 30 states have (on average 7.733333333333333) internal successors, (232), 29 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:04:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:54,988 INFO L93 Difference]: Finished difference Result 16831 states and 21500 transitions. [2024-10-12 20:04:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-12 20:04:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.733333333333333) internal successors, (232), 29 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:04:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:55,012 INFO L225 Difference]: With dead ends: 16831 [2024-10-12 20:04:55,012 INFO L226 Difference]: Without dead ends: 12409 [2024-10-12 20:04:55,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1400, Invalid=5406, Unknown=0, NotChecked=0, Total=6806 [2024-10-12 20:04:55,020 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1531 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:55,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1199 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:04:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12409 states. [2024-10-12 20:04:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12409 to 6347. [2024-10-12 20:04:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6346 states have (on average 1.247399936968169) internal successors, (7916), 6346 states have internal predecessors, (7916), 0 states have call successors, (0), 0 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:04:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 7916 transitions. [2024-10-12 20:04:55,423 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 7916 transitions. Word has length 96 [2024-10-12 20:04:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:55,423 INFO L471 AbstractCegarLoop]: Abstraction has 6347 states and 7916 transitions. [2024-10-12 20:04:55,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.733333333333333) internal successors, (232), 29 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:04:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 7916 transitions. [2024-10-12 20:04:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:04:55,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:55,425 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:55,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 20:04:55,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:55,626 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:55,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -88753700, now seen corresponding path program 1 times [2024-10-12 20:04:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257642103] [2024-10-12 20:04:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:04:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257642103] [2024-10-12 20:04:56,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257642103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:04:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697163788] [2024-10-12 20:04:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:56,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:04:56,421 INFO L229 MonitoredProcess]: Starting monitored process 8 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:04:56,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 20:04:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:04:56,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 20:04:56,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:04:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:57,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:04:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:04:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697163788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:04:58,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:04:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 32 [2024-10-12 20:04:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948366571] [2024-10-12 20:04:58,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:04:58,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-12 20:04:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:04:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-12 20:04:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:04:58,337 INFO L87 Difference]: Start difference. First operand 6347 states and 7916 transitions. Second operand has 33 states, 33 states have (on average 7.545454545454546) internal successors, (249), 32 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:04:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:04:59,367 INFO L93 Difference]: Finished difference Result 9379 states and 11771 transitions. [2024-10-12 20:04:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:04:59,367 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.545454545454546) internal successors, (249), 32 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:04:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:04:59,377 INFO L225 Difference]: With dead ends: 9379 [2024-10-12 20:04:59,378 INFO L226 Difference]: Without dead ends: 6483 [2024-10-12 20:04:59,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=447, Invalid=1905, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 20:04:59,382 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1001 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:04:59,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 465 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:04:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6483 states. [2024-10-12 20:04:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6483 to 3143. [2024-10-12 20:04:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3142 states have (on average 1.2412476129853596) internal successors, (3900), 3142 states have internal predecessors, (3900), 0 states have call successors, (0), 0 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:04:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 3900 transitions. [2024-10-12 20:04:59,663 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 3900 transitions. Word has length 96 [2024-10-12 20:04:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:04:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 3143 states and 3900 transitions. [2024-10-12 20:04:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.545454545454546) internal successors, (249), 32 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:04:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 3900 transitions. [2024-10-12 20:04:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:04:59,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:04:59,665 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:04:59,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 20:04:59,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:04:59,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:04:59,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:04:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1867936502, now seen corresponding path program 1 times [2024-10-12 20:04:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:04:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684118276] [2024-10-12 20:04:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:04:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:04:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684118276] [2024-10-12 20:05:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684118276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:00,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875079998] [2024-10-12 20:05:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:00,759 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:00,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 20:05:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:00,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 20:05:00,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:03,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875079998] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:05,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:05,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2024-10-12 20:05:05,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126340066] [2024-10-12 20:05:05,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:05,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-12 20:05:05,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:05,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-12 20:05:05,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2640, Unknown=0, NotChecked=0, Total=2862 [2024-10-12 20:05:05,716 INFO L87 Difference]: Start difference. First operand 3143 states and 3900 transitions. Second operand has 54 states, 54 states have (on average 4.981481481481482) internal successors, (269), 53 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)