./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-var-start-time.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:21:03,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:21:03,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:21:03,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:21:03,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:21:03,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:21:03,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:21:03,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:21:03,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:21:03,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:21:03,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:21:03,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:21:03,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:21:03,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:21:03,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:21:03,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:21:03,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:21:03,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:21:03,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:21:03,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:21:03,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:21:03,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:21:03,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:21:03,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:21:03,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:21:03,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:21:03,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:21:03,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:21:03,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:21:03,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:21:03,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:21:03,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:21:03,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:21:03,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:21:03,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:21:03,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:21:03,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:21:03,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:21:03,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:21:03,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:21:03,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:21:03,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:21:03,743 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d [2024-10-11 03:21:03,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:21:04,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:21:04,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:21:04,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:21:04,022 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:21:04,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-10-11 03:21:05,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:21:05,728 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:21:05,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-10-11 03:21:05,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ed35f90b/acfd0124d85645d2b8673a5550a60129/FLAG70d5e0fc2 [2024-10-11 03:21:05,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ed35f90b/acfd0124d85645d2b8673a5550a60129 [2024-10-11 03:21:05,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:21:05,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:21:05,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:21:05,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:21:05,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:21:05,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:05" (1/1) ... [2024-10-11 03:21:05,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652515d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:05, skipping insertion in model container [2024-10-11 03:21:05,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:21:05" (1/1) ... [2024-10-11 03:21:05,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:21:06,051 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-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2024-10-11 03:21:06,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:21:06,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:21:06,135 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-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2024-10-11 03:21:06,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:21:06,158 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:21:06,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06 WrapperNode [2024-10-11 03:21:06,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:21:06,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:21:06,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:21:06,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:21:06,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,225 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 315 [2024-10-11 03:21:06,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:21:06,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:21:06,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:21:06,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:21:06,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,265 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:21:06,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:21:06,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:21:06,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:21:06,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:21:06,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (1/1) ... [2024-10-11 03:21:06,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:21:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:06,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:21:06,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:21:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:21:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:21:06,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:21:06,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:21:06,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:21:06,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:21:06,972 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-11 03:21:06,973 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:21:07,036 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:21:07,038 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:21:07,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:07 BoogieIcfgContainer [2024-10-11 03:21:07,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:21:07,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:21:07,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:21:07,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:21:07,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:21:05" (1/3) ... [2024-10-11 03:21:07,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2c266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:07, skipping insertion in model container [2024-10-11 03:21:07,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:21:06" (2/3) ... [2024-10-11 03:21:07,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2c266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:21:07, skipping insertion in model container [2024-10-11 03:21:07,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:21:07" (3/3) ... [2024-10-11 03:21:07,049 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-10-11 03:21:07,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:21:07,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:21:07,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:21:07,141 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;@23ccb203, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:21:07,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:21:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 78 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:21:07,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:07,157 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] [2024-10-11 03:21:07,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -408434164, now seen corresponding path program 1 times [2024-10-11 03:21:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504255514] [2024-10-11 03:21:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504255514] [2024-10-11 03:21:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504255514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:21:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567153893] [2024-10-11 03:21:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:21:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:07,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:21:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:21:07,505 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 78 states have internal predecessors, (137), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:07,545 INFO L93 Difference]: Finished difference Result 131 states and 222 transitions. [2024-10-11 03:21:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:21:07,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-11 03:21:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:07,558 INFO L225 Difference]: With dead ends: 131 [2024-10-11 03:21:07,558 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 03:21:07,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:21:07,568 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:07,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 03:21:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 03:21:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.736842105263158) internal successors, (132), 76 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 132 transitions. [2024-10-11 03:21:07,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 132 transitions. Word has length 26 [2024-10-11 03:21:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:07,609 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 132 transitions. [2024-10-11 03:21:07,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 132 transitions. [2024-10-11 03:21:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:21:07,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:07,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:07,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:21:07,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2081094798, now seen corresponding path program 1 times [2024-10-11 03:21:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228966359] [2024-10-11 03:21:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228966359] [2024-10-11 03:21:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228966359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:21:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749966822] [2024-10-11 03:21:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:07,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:21:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:21:07,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:07,840 INFO L87 Difference]: Start difference. First operand 77 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:07,941 INFO L93 Difference]: Finished difference Result 178 states and 295 transitions. [2024-10-11 03:21:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:21:07,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-11 03:21:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:07,945 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:21:07,945 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 03:21:07,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:07,947 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 79 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:07,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 354 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 03:21:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 77. [2024-10-11 03:21:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2024-10-11 03:21:07,957 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 26 [2024-10-11 03:21:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:07,957 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2024-10-11 03:21:07,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2024-10-11 03:21:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:21:07,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:07,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:21:07,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1094162009, now seen corresponding path program 1 times [2024-10-11 03:21:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720227731] [2024-10-11 03:21:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720227731] [2024-10-11 03:21:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720227731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297117799] [2024-10-11 03:21:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:08,095 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:08,139 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-10-11 03:21:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:08,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:21:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:08,141 INFO L225 Difference]: With dead ends: 167 [2024-10-11 03:21:08,141 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 03:21:08,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:08,143 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 03:21:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-11 03:21:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 115 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-11 03:21:08,161 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 49 [2024-10-11 03:21:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:08,161 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-11 03:21:08,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-11 03:21:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:21:08,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:08,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:21:08,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:08,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -114750088, now seen corresponding path program 1 times [2024-10-11 03:21:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746562325] [2024-10-11 03:21:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746562325] [2024-10-11 03:21:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746562325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915799769] [2024-10-11 03:21:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:08,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:08,308 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:08,344 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2024-10-11 03:21:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:21:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:08,347 INFO L225 Difference]: With dead ends: 276 [2024-10-11 03:21:08,347 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 03:21:08,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:08,351 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:08,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 226 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 03:21:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-10-11 03:21:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.5405405405405406) internal successors, (285), 185 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 285 transitions. [2024-10-11 03:21:08,371 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 285 transitions. Word has length 49 [2024-10-11 03:21:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 285 transitions. [2024-10-11 03:21:08,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 285 transitions. [2024-10-11 03:21:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:21:08,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:08,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:21:08,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:08,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash 796453911, now seen corresponding path program 1 times [2024-10-11 03:21:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747304678] [2024-10-11 03:21:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747304678] [2024-10-11 03:21:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747304678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603287981] [2024-10-11 03:21:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:08,557 INFO L87 Difference]: Start difference. First operand 186 states and 285 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:08,711 INFO L93 Difference]: Finished difference Result 976 states and 1570 transitions. [2024-10-11 03:21:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:08,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 03:21:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:08,718 INFO L225 Difference]: With dead ends: 976 [2024-10-11 03:21:08,718 INFO L226 Difference]: Without dead ends: 818 [2024-10-11 03:21:08,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:08,723 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 733 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:08,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 660 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-11 03:21:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 342. [2024-10-11 03:21:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.563049853372434) internal successors, (533), 341 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 533 transitions. [2024-10-11 03:21:08,789 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 533 transitions. Word has length 49 [2024-10-11 03:21:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 533 transitions. [2024-10-11 03:21:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 533 transitions. [2024-10-11 03:21:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:21:08,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:08,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:08,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:21:08,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:08,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1092763391, now seen corresponding path program 1 times [2024-10-11 03:21:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772146038] [2024-10-11 03:21:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772146038] [2024-10-11 03:21:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772146038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:09,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:09,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:21:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561169866] [2024-10-11 03:21:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:21:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:21:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:09,057 INFO L87 Difference]: Start difference. First operand 342 states and 533 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:09,087 INFO L93 Difference]: Finished difference Result 360 states and 558 transitions. [2024-10-11 03:21:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:21:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 03:21:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:09,090 INFO L225 Difference]: With dead ends: 360 [2024-10-11 03:21:09,090 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 03:21:09,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:21:09,093 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:09,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 03:21:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-10-11 03:21:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.5378151260504203) internal successors, (549), 357 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 549 transitions. [2024-10-11 03:21:09,122 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 549 transitions. Word has length 50 [2024-10-11 03:21:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 549 transitions. [2024-10-11 03:21:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 549 transitions. [2024-10-11 03:21:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:21:09,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:09,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:21:09,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 485103743, now seen corresponding path program 1 times [2024-10-11 03:21:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350762788] [2024-10-11 03:21:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350762788] [2024-10-11 03:21:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350762788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784821549] [2024-10-11 03:21:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:09,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:09,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,197 INFO L87 Difference]: Start difference. First operand 358 states and 549 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-11 03:21:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:09,228 INFO L93 Difference]: Finished difference Result 962 states and 1495 transitions. [2024-10-11 03:21:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:09,229 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-11 03:21:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:09,232 INFO L225 Difference]: With dead ends: 962 [2024-10-11 03:21:09,232 INFO L226 Difference]: Without dead ends: 632 [2024-10-11 03:21:09,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,236 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 49 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:09,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-11 03:21:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2024-10-11 03:21:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 1.534181240063593) internal successors, (965), 629 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 965 transitions. [2024-10-11 03:21:09,265 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 965 transitions. Word has length 51 [2024-10-11 03:21:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:09,266 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 965 transitions. [2024-10-11 03:21:09,266 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-11 03:21:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 965 transitions. [2024-10-11 03:21:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:21:09,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:09,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:09,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:21:09,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1884075168, now seen corresponding path program 1 times [2024-10-11 03:21:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833184533] [2024-10-11 03:21:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:09,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833184533] [2024-10-11 03:21:09,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833184533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:09,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284202865] [2024-10-11 03:21:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,359 INFO L87 Difference]: Start difference. First operand 630 states and 965 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-11 03:21:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:09,401 INFO L93 Difference]: Finished difference Result 1228 states and 1898 transitions. [2024-10-11 03:21:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:09,402 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-11 03:21:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:09,406 INFO L225 Difference]: With dead ends: 1228 [2024-10-11 03:21:09,406 INFO L226 Difference]: Without dead ends: 898 [2024-10-11 03:21:09,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,410 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 68 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:09,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 239 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-11 03:21:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 896. [2024-10-11 03:21:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 1.5273743016759778) internal successors, (1367), 895 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1367 transitions. [2024-10-11 03:21:09,445 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1367 transitions. Word has length 51 [2024-10-11 03:21:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:09,445 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1367 transitions. [2024-10-11 03:21:09,445 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-11 03:21:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1367 transitions. [2024-10-11 03:21:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:21:09,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:21:09,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2119290152, now seen corresponding path program 1 times [2024-10-11 03:21:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832237872] [2024-10-11 03:21:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832237872] [2024-10-11 03:21:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832237872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557679653] [2024-10-11 03:21:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:09,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,535 INFO L87 Difference]: Start difference. First operand 896 states and 1367 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-11 03:21:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:09,597 INFO L93 Difference]: Finished difference Result 2436 states and 3705 transitions. [2024-10-11 03:21:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:09,597 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-11 03:21:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:09,605 INFO L225 Difference]: With dead ends: 2436 [2024-10-11 03:21:09,605 INFO L226 Difference]: Without dead ends: 1570 [2024-10-11 03:21:09,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,608 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 56 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:09,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-11 03:21:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1568. [2024-10-11 03:21:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4952137843012125) internal successors, (2343), 1567 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2343 transitions. [2024-10-11 03:21:09,666 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2343 transitions. Word has length 52 [2024-10-11 03:21:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:09,667 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2343 transitions. [2024-10-11 03:21:09,667 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-11 03:21:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2343 transitions. [2024-10-11 03:21:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:21:09,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:09,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:09,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:21:09,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2124847998, now seen corresponding path program 1 times [2024-10-11 03:21:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320845139] [2024-10-11 03:21:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320845139] [2024-10-11 03:21:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320845139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539547195] [2024-10-11 03:21:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,839 INFO L87 Difference]: Start difference. First operand 1568 states and 2343 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:09,887 INFO L93 Difference]: Finished difference Result 3108 states and 4657 transitions. [2024-10-11 03:21:09,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:09,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-11 03:21:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:09,893 INFO L225 Difference]: With dead ends: 3108 [2024-10-11 03:21:09,893 INFO L226 Difference]: Without dead ends: 1570 [2024-10-11 03:21:09,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:09,895 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:09,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 224 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-11 03:21:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1568. [2024-10-11 03:21:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4798978940650924) internal successors, (2319), 1567 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2319 transitions. [2024-10-11 03:21:09,946 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2319 transitions. Word has length 73 [2024-10-11 03:21:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:09,946 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2319 transitions. [2024-10-11 03:21:09,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2319 transitions. [2024-10-11 03:21:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 03:21:09,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:09,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:09,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:21:09,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -172725725, now seen corresponding path program 1 times [2024-10-11 03:21:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160934625] [2024-10-11 03:21:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:21:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160934625] [2024-10-11 03:21:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160934625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912824370] [2024-10-11 03:21:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:10,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:10,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:10,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:10,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:21:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:10,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:21:10,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:10,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912824370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:11,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-10-11 03:21:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159438079] [2024-10-11 03:21:11,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:11,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:21:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:21:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:21:11,764 INFO L87 Difference]: Start difference. First operand 1568 states and 2319 transitions. Second operand has 14 states, 14 states have (on average 13.714285714285714) internal successors, (192), 14 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:12,564 INFO L93 Difference]: Finished difference Result 6104 states and 8928 transitions. [2024-10-11 03:21:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:21:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.714285714285714) internal successors, (192), 14 states have internal predecessors, (192), 0 states have call successors, (0), 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 73 [2024-10-11 03:21:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:12,583 INFO L225 Difference]: With dead ends: 6104 [2024-10-11 03:21:12,583 INFO L226 Difference]: Without dead ends: 4566 [2024-10-11 03:21:12,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:21:12,588 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1843 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:12,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 735 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:21:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2024-10-11 03:21:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 3820. [2024-10-11 03:21:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3820 states, 3819 states have (on average 1.4456664048180152) internal successors, (5521), 3819 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 5521 transitions. [2024-10-11 03:21:12,729 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 5521 transitions. Word has length 73 [2024-10-11 03:21:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 3820 states and 5521 transitions. [2024-10-11 03:21:12,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.714285714285714) internal successors, (192), 14 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 5521 transitions. [2024-10-11 03:21:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:12,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:12,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:12,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:21:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 03:21:12,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:12,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1185783157, now seen corresponding path program 1 times [2024-10-11 03:21:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822349955] [2024-10-11 03:21:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:21:13,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822349955] [2024-10-11 03:21:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822349955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:13,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561498861] [2024-10-11 03:21:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:13,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:13,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:13,057 INFO L87 Difference]: Start difference. First operand 3820 states and 5521 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:13,395 INFO L93 Difference]: Finished difference Result 11403 states and 16634 transitions. [2024-10-11 03:21:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:13,431 INFO L225 Difference]: With dead ends: 11403 [2024-10-11 03:21:13,431 INFO L226 Difference]: Without dead ends: 9497 [2024-10-11 03:21:13,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:13,438 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 452 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:13,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 725 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9497 states. [2024-10-11 03:21:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9497 to 5674. [2024-10-11 03:21:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 5673 states have (on average 1.438744932134673) internal successors, (8162), 5673 states have internal predecessors, (8162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 8162 transitions. [2024-10-11 03:21:13,723 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 8162 transitions. Word has length 74 [2024-10-11 03:21:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:13,723 INFO L471 AbstractCegarLoop]: Abstraction has 5674 states and 8162 transitions. [2024-10-11 03:21:13,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 8162 transitions. [2024-10-11 03:21:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:13,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:13,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:21:13,725 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:13,726 INFO L85 PathProgramCache]: Analyzing trace with hash 946628745, now seen corresponding path program 1 times [2024-10-11 03:21:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518076702] [2024-10-11 03:21:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:21:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518076702] [2024-10-11 03:21:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518076702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:13,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:13,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:13,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482924488] [2024-10-11 03:21:13,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:13,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:13,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:13,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:13,861 INFO L87 Difference]: Start difference. First operand 5674 states and 8162 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:14,284 INFO L93 Difference]: Finished difference Result 13257 states and 19275 transitions. [2024-10-11 03:21:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:14,329 INFO L225 Difference]: With dead ends: 13257 [2024-10-11 03:21:14,332 INFO L226 Difference]: Without dead ends: 11351 [2024-10-11 03:21:14,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:14,342 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 453 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:14,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 679 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11351 states. [2024-10-11 03:21:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11351 to 7521. [2024-10-11 03:21:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7521 states, 7520 states have (on average 1.4351063829787234) internal successors, (10792), 7520 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7521 states to 7521 states and 10792 transitions. [2024-10-11 03:21:14,686 INFO L78 Accepts]: Start accepts. Automaton has 7521 states and 10792 transitions. Word has length 74 [2024-10-11 03:21:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:14,686 INFO L471 AbstractCegarLoop]: Abstraction has 7521 states and 10792 transitions. [2024-10-11 03:21:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7521 states and 10792 transitions. [2024-10-11 03:21:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:14,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:14,688 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:14,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:21:14,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash -855302777, now seen corresponding path program 1 times [2024-10-11 03:21:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083886205] [2024-10-11 03:21:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:21:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083886205] [2024-10-11 03:21:14,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083886205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:14,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448901528] [2024-10-11 03:21:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:14,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:14,812 INFO L87 Difference]: Start difference. First operand 7521 states and 10792 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:15,213 INFO L93 Difference]: Finished difference Result 15088 states and 21878 transitions. [2024-10-11 03:21:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:15,239 INFO L225 Difference]: With dead ends: 15088 [2024-10-11 03:21:15,239 INFO L226 Difference]: Without dead ends: 13182 [2024-10-11 03:21:15,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:15,246 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 496 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:15,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 663 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13182 states. [2024-10-11 03:21:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13182 to 9359. [2024-10-11 03:21:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9359 states, 9358 states have (on average 1.4325710621927763) internal successors, (13406), 9358 states have internal predecessors, (13406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9359 states to 9359 states and 13406 transitions. [2024-10-11 03:21:15,623 INFO L78 Accepts]: Start accepts. Automaton has 9359 states and 13406 transitions. Word has length 74 [2024-10-11 03:21:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:15,623 INFO L471 AbstractCegarLoop]: Abstraction has 9359 states and 13406 transitions. [2024-10-11 03:21:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9359 states and 13406 transitions. [2024-10-11 03:21:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:21:15,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:15,624 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:21:15,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1479802491, now seen corresponding path program 1 times [2024-10-11 03:21:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203518507] [2024-10-11 03:21:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:21:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203518507] [2024-10-11 03:21:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203518507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:21:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189024460] [2024-10-11 03:21:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:21:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:15,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:21:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:21:15,792 INFO L87 Difference]: Start difference. First operand 9359 states and 13406 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:16,298 INFO L93 Difference]: Finished difference Result 16912 states and 24470 transitions. [2024-10-11 03:21:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:21:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 03:21:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:16,329 INFO L225 Difference]: With dead ends: 16912 [2024-10-11 03:21:16,329 INFO L226 Difference]: Without dead ends: 15006 [2024-10-11 03:21:16,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:21:16,339 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 463 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:16,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 729 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:21:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15006 states. [2024-10-11 03:21:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15006 to 11183. [2024-10-11 03:21:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 11182 states have (on average 1.430692183866929) internal successors, (15998), 11182 states have internal predecessors, (15998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 15998 transitions. [2024-10-11 03:21:16,743 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 15998 transitions. Word has length 74 [2024-10-11 03:21:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:16,743 INFO L471 AbstractCegarLoop]: Abstraction has 11183 states and 15998 transitions. [2024-10-11 03:21:16,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 15998 transitions. [2024-10-11 03:21:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:21:16,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:16,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:16,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:21:16,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1454634311, now seen corresponding path program 1 times [2024-10-11 03:21:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095737866] [2024-10-11 03:21:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:17,163 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-11 03:21:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095737866] [2024-10-11 03:21:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095737866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:21:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759826870] [2024-10-11 03:21:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:21:17,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:21:17,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:21:17,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:21:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:17,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 03:21:17,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:21:18,021 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-11 03:21:18,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:21:19,133 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-11 03:21:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759826870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:21:19,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:21:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-11 03:21:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78696440] [2024-10-11 03:21:19,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:21:19,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:21:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:19,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:21:19,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:21:19,135 INFO L87 Difference]: Start difference. First operand 11183 states and 15998 transitions. Second operand has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 28 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:36,217 INFO L93 Difference]: Finished difference Result 263496 states and 381384 transitions. [2024-10-11 03:21:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2024-10-11 03:21:36,218 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 28 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 03:21:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:37,004 INFO L225 Difference]: With dead ends: 263496 [2024-10-11 03:21:37,004 INFO L226 Difference]: Without dead ends: 252345 [2024-10-11 03:21:37,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20172 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=6543, Invalid=42963, Unknown=0, NotChecked=0, Total=49506 [2024-10-11 03:21:37,088 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 11429 mSDsluCounter, 3372 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11429 SdHoareTripleChecker+Valid, 3600 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:37,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11429 Valid, 3600 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 03:21:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252345 states. [2024-10-11 03:21:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252345 to 112865. [2024-10-11 03:21:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112865 states, 112864 states have (on average 1.4180872554578963) internal successors, (160051), 112864 states have internal predecessors, (160051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112865 states to 112865 states and 160051 transitions. [2024-10-11 03:21:42,576 INFO L78 Accepts]: Start accepts. Automaton has 112865 states and 160051 transitions. Word has length 77 [2024-10-11 03:21:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:42,577 INFO L471 AbstractCegarLoop]: Abstraction has 112865 states and 160051 transitions. [2024-10-11 03:21:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 28 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 112865 states and 160051 transitions. [2024-10-11 03:21:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:21:42,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:42,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:42,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:21:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 03:21:42,781 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -361103304, now seen corresponding path program 1 times [2024-10-11 03:21:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913846804] [2024-10-11 03:21:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:21:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913846804] [2024-10-11 03:21:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913846804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:42,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824405528] [2024-10-11 03:21:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:42,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:42,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:42,883 INFO L87 Difference]: Start difference. First operand 112865 states and 160051 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:45,096 INFO L93 Difference]: Finished difference Result 167337 states and 237021 transitions. [2024-10-11 03:21:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 03:21:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:45,213 INFO L225 Difference]: With dead ends: 167337 [2024-10-11 03:21:45,213 INFO L226 Difference]: Without dead ends: 54876 [2024-10-11 03:21:45,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:45,294 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 41 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:45,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54876 states. [2024-10-11 03:21:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54876 to 54226. [2024-10-11 03:21:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54226 states, 54225 states have (on average 1.390391885661595) internal successors, (75394), 54225 states have internal predecessors, (75394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54226 states to 54226 states and 75394 transitions. [2024-10-11 03:21:47,112 INFO L78 Accepts]: Start accepts. Automaton has 54226 states and 75394 transitions. Word has length 77 [2024-10-11 03:21:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:47,113 INFO L471 AbstractCegarLoop]: Abstraction has 54226 states and 75394 transitions. [2024-10-11 03:21:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 54226 states and 75394 transitions. [2024-10-11 03:21:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:21:47,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:47,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:47,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:21:47,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1246398753, now seen corresponding path program 1 times [2024-10-11 03:21:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494679969] [2024-10-11 03:21:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:47,206 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-11 03:21:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494679969] [2024-10-11 03:21:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494679969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869056268] [2024-10-11 03:21:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:47,209 INFO L87 Difference]: Start difference. First operand 54226 states and 75394 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:49,895 INFO L93 Difference]: Finished difference Result 146316 states and 202761 transitions. [2024-10-11 03:21:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 03:21:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:50,063 INFO L225 Difference]: With dead ends: 146316 [2024-10-11 03:21:50,063 INFO L226 Difference]: Without dead ends: 92404 [2024-10-11 03:21:50,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:50,121 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:50,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 210 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92404 states. [2024-10-11 03:21:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92404 to 92402. [2024-10-11 03:21:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92402 states, 92401 states have (on average 1.3666302312745533) internal successors, (126278), 92401 states have internal predecessors, (126278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92402 states to 92402 states and 126278 transitions. [2024-10-11 03:21:53,796 INFO L78 Accepts]: Start accepts. Automaton has 92402 states and 126278 transitions. Word has length 78 [2024-10-11 03:21:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:21:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 92402 states and 126278 transitions. [2024-10-11 03:21:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 92402 states and 126278 transitions. [2024-10-11 03:21:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:21:53,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:21:53,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:21:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:21:53,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:21:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:21:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1452646381, now seen corresponding path program 1 times [2024-10-11 03:21:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:21:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678049935] [2024-10-11 03:21:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:21:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:21:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:21:53,867 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-11 03:21:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:21:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678049935] [2024-10-11 03:21:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678049935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:21:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:21:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:21:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113836408] [2024-10-11 03:21:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:21:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:21:53,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:21:53,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:21:53,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:53,870 INFO L87 Difference]: Start difference. First operand 92402 states and 126278 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:21:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:21:57,424 INFO L93 Difference]: Finished difference Result 199587 states and 272309 transitions. [2024-10-11 03:21:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:21:57,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 03:21:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:21:57,596 INFO L225 Difference]: With dead ends: 199587 [2024-10-11 03:21:57,596 INFO L226 Difference]: Without dead ends: 107395 [2024-10-11 03:21:57,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:21:57,650 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 49 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:21:57,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 248 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:21:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107395 states. [2024-10-11 03:22:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107395 to 97337. [2024-10-11 03:22:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97337 states, 97336 states have (on average 1.3449494534396318) internal successors, (130912), 97336 states have internal predecessors, (130912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97337 states to 97337 states and 130912 transitions. [2024-10-11 03:22:01,273 INFO L78 Accepts]: Start accepts. Automaton has 97337 states and 130912 transitions. Word has length 78 [2024-10-11 03:22:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:22:01,275 INFO L471 AbstractCegarLoop]: Abstraction has 97337 states and 130912 transitions. [2024-10-11 03:22:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:22:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 97337 states and 130912 transitions. [2024-10-11 03:22:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 03:22:01,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:22:01,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:22:01,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:22:01,280 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:22:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:22:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -801187947, now seen corresponding path program 1 times [2024-10-11 03:22:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:22:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279630522] [2024-10-11 03:22:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:22:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:01,974 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-11 03:22:01,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:22:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279630522] [2024-10-11 03:22:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279630522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:22:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856164404] [2024-10-11 03:22:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:22:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:22:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:22:01,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:22:01,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:22:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:22:02,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:22:02,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:22:04,133 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-11 03:22:04,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:22:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:22:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856164404] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:22:07,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:22:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 17] total 41 [2024-10-11 03:22:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730460737] [2024-10-11 03:22:07,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:22:07,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 03:22:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:22:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 03:22:07,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 03:22:07,153 INFO L87 Difference]: Start difference. First operand 97337 states and 130912 transitions. Second operand has 41 states, 41 states have (on average 5.2439024390243905) internal successors, (215), 41 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)