./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:12:42,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:12:42,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:12:42,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:12:42,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:12:42,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:12:42,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:12:42,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:12:42,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:12:42,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:12:42,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:12:42,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:12:42,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:12:42,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:12:42,834 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:12:42,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:12:42,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:12:42,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:12:42,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:12:42,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:12:42,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:12:42,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:12:42,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:12:42,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:12:42,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:12:42,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:12:42,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:12:42,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:12:42,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:12:42,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:12:42,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:12:42,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:12:42,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:42,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:12:42,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:12:42,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:12:42,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:12:42,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:12:42,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:12:42,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:12:42,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:12:42,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:12:42,847 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ae342bfdc7bf76083bf4321cb5b6b26fe707bda9cd6edf475282aebbd1033a [2024-11-11 21:12:43,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:12:43,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:12:43,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:12:43,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:12:43,119 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:12:43,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:44,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:12:44,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:12:44,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:44,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef14925bc/6ad3aee7cfb64dcb9abebbcbd3f46bee/FLAG02ac8f4b2 [2024-11-11 21:12:44,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef14925bc/6ad3aee7cfb64dcb9abebbcbd3f46bee [2024-11-11 21:12:44,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:12:44,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:12:44,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:44,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:12:44,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:12:44,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:44" (1/1) ... [2024-11-11 21:12:44,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2ba3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:44, skipping insertion in model container [2024-11-11 21:12:44,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:44" (1/1) ... [2024-11-11 21:12:44,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:12:45,152 WARN L250 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_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-11 21:12:45,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:45,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:12:45,246 WARN L250 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_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-11 21:12:45,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:45,273 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:12:45,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45 WrapperNode [2024-11-11 21:12:45,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:45,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:45,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:12:45,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:12:45,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,350 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-11 21:12:45,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:45,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:12:45,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:12:45,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:12:45,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,388 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-11-11 21:12:45,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:12:45,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:12:45,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:12:45,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:12:45,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (1/1) ... [2024-11-11 21:12:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:45,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:12:45,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:12:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:12:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:12:45,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:12:45,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:12:45,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:12:45,663 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:12:46,263 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-11 21:12:46,264 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:12:46,284 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:12:46,284 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:12:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:46 BoogieIcfgContainer [2024-11-11 21:12:46,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:12:46,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:12:46,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:12:46,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:12:46,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:12:44" (1/3) ... [2024-11-11 21:12:46,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb53d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:46, skipping insertion in model container [2024-11-11 21:12:46,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:45" (2/3) ... [2024-11-11 21:12:46,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb53d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:46, skipping insertion in model container [2024-11-11 21:12:46,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:46" (3/3) ... [2024-11-11 21:12:46,297 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:46,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:12:46,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:12:46,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:12:46,404 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;@7f7bc168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:12:46,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:12:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 117 states have (on average 1.7863247863247864) internal successors, (209), 118 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:12:46,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:46,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:46,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash 901132838, now seen corresponding path program 1 times [2024-11-11 21:12:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100504949] [2024-11-11 21:12:46,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100504949] [2024-11-11 21:12:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100504949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:12:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647251127] [2024-11-11 21:12:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:46,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:12:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:12:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:12:46,816 INFO L87 Difference]: Start difference. First operand has 119 states, 117 states have (on average 1.7863247863247864) internal successors, (209), 118 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:46,837 INFO L93 Difference]: Finished difference Result 182 states and 316 transitions. [2024-11-11 21:12:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:12:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 21:12:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:46,848 INFO L225 Difference]: With dead ends: 182 [2024-11-11 21:12:46,848 INFO L226 Difference]: Without dead ends: 115 [2024-11-11 21:12:46,850 INFO L434 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-11-11 21:12:46,853 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:46,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-11 21:12:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-11 21:12:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 114 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 202 transitions. [2024-11-11 21:12:46,888 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 202 transitions. Word has length 37 [2024-11-11 21:12:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:46,888 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 202 transitions. [2024-11-11 21:12:46,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 202 transitions. [2024-11-11 21:12:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:12:46,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:46,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:46,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:12:46,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:46,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash 83484388, now seen corresponding path program 1 times [2024-11-11 21:12:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294572064] [2024-11-11 21:12:46,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294572064] [2024-11-11 21:12:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294572064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692067729] [2024-11-11 21:12:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:47,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:47,134 INFO L87 Difference]: Start difference. First operand 115 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:47,247 INFO L93 Difference]: Finished difference Result 235 states and 406 transitions. [2024-11-11 21:12:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 21:12:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:47,249 INFO L225 Difference]: With dead ends: 235 [2024-11-11 21:12:47,249 INFO L226 Difference]: Without dead ends: 173 [2024-11-11 21:12:47,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:47,252 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:47,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 759 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-11 21:12:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2024-11-11 21:12:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2024-11-11 21:12:47,262 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 37 [2024-11-11 21:12:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:47,263 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2024-11-11 21:12:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-11 21:12:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:12:47,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:47,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:47,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:12:47,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash -105296595, now seen corresponding path program 1 times [2024-11-11 21:12:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009642651] [2024-11-11 21:12:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009642651] [2024-11-11 21:12:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009642651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136621762] [2024-11-11 21:12:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:47,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:47,450 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:47,504 INFO L93 Difference]: Finished difference Result 222 states and 358 transitions. [2024-11-11 21:12:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:12:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:47,507 INFO L225 Difference]: With dead ends: 222 [2024-11-11 21:12:47,507 INFO L226 Difference]: Without dead ends: 164 [2024-11-11 21:12:47,507 INFO L434 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-11-11 21:12:47,510 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:47,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-11 21:12:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-11 21:12:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.565217391304348) internal successors, (252), 161 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2024-11-11 21:12:47,521 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 63 [2024-11-11 21:12:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:47,522 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2024-11-11 21:12:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2024-11-11 21:12:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:12:47,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:47,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:47,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:12:47,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2025700882, now seen corresponding path program 1 times [2024-11-11 21:12:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106295572] [2024-11-11 21:12:47,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106295572] [2024-11-11 21:12:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106295572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705349368] [2024-11-11 21:12:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:47,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:47,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:47,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:47,634 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:47,658 INFO L93 Difference]: Finished difference Result 269 states and 435 transitions. [2024-11-11 21:12:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:47,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:12:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:47,661 INFO L225 Difference]: With dead ends: 269 [2024-11-11 21:12:47,661 INFO L226 Difference]: Without dead ends: 211 [2024-11-11 21:12:47,662 INFO L434 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-11-11 21:12:47,662 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:47,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-11 21:12:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2024-11-11 21:12:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 208 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 332 transitions. [2024-11-11 21:12:47,677 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 332 transitions. Word has length 65 [2024-11-11 21:12:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:47,677 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 332 transitions. [2024-11-11 21:12:47,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 332 transitions. [2024-11-11 21:12:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:12:47,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:47,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:12:47,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 34844053, now seen corresponding path program 1 times [2024-11-11 21:12:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771765822] [2024-11-11 21:12:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771765822] [2024-11-11 21:12:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771765822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:47,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751186986] [2024-11-11 21:12:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:47,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:47,827 INFO L87 Difference]: Start difference. First operand 209 states and 332 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:47,880 INFO L93 Difference]: Finished difference Result 488 states and 803 transitions. [2024-11-11 21:12:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:47,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-11 21:12:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:47,884 INFO L225 Difference]: With dead ends: 488 [2024-11-11 21:12:47,884 INFO L226 Difference]: Without dead ends: 338 [2024-11-11 21:12:47,885 INFO L434 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-11-11 21:12:47,888 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:47,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-11 21:12:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2024-11-11 21:12:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.6238805970149253) internal successors, (544), 335 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 544 transitions. [2024-11-11 21:12:47,912 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 544 transitions. Word has length 65 [2024-11-11 21:12:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 544 transitions. [2024-11-11 21:12:47,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 544 transitions. [2024-11-11 21:12:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:12:47,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:47,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:47,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:12:47,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:47,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1167801350, now seen corresponding path program 1 times [2024-11-11 21:12:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526434235] [2024-11-11 21:12:47,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:48,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526434235] [2024-11-11 21:12:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526434235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:48,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287983583] [2024-11-11 21:12:48,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:48,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:48,028 INFO L87 Difference]: Start difference. First operand 336 states and 544 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:48,055 INFO L93 Difference]: Finished difference Result 609 states and 1003 transitions. [2024-11-11 21:12:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:12:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:48,062 INFO L225 Difference]: With dead ends: 609 [2024-11-11 21:12:48,062 INFO L226 Difference]: Without dead ends: 459 [2024-11-11 21:12:48,063 INFO L434 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-11-11 21:12:48,064 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:48,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-11 21:12:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-11-11 21:12:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.6293859649122806) internal successors, (743), 456 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 743 transitions. [2024-11-11 21:12:48,083 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 743 transitions. Word has length 67 [2024-11-11 21:12:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:48,084 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 743 transitions. [2024-11-11 21:12:48,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 743 transitions. [2024-11-11 21:12:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:12:48,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:48,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:12:48,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -171119363, now seen corresponding path program 1 times [2024-11-11 21:12:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21118119] [2024-11-11 21:12:48,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21118119] [2024-11-11 21:12:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21118119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:48,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814195139] [2024-11-11 21:12:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:48,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:48,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:48,209 INFO L87 Difference]: Start difference. First operand 457 states and 743 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:48,239 INFO L93 Difference]: Finished difference Result 1178 states and 1942 transitions. [2024-11-11 21:12:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:12:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:48,244 INFO L225 Difference]: With dead ends: 1178 [2024-11-11 21:12:48,244 INFO L226 Difference]: Without dead ends: 786 [2024-11-11 21:12:48,245 INFO L434 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-11-11 21:12:48,248 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:48,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 379 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-11 21:12:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-11-11 21:12:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.6270753512132823) internal successors, (1274), 783 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1274 transitions. [2024-11-11 21:12:48,274 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1274 transitions. Word has length 67 [2024-11-11 21:12:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1274 transitions. [2024-11-11 21:12:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1274 transitions. [2024-11-11 21:12:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:12:48,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:48,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:12:48,277 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1554688226, now seen corresponding path program 1 times [2024-11-11 21:12:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832572729] [2024-11-11 21:12:48,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832572729] [2024-11-11 21:12:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832572729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416604281] [2024-11-11 21:12:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:48,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:48,356 INFO L87 Difference]: Start difference. First operand 784 states and 1274 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:48,384 INFO L93 Difference]: Finished difference Result 1475 states and 2419 transitions. [2024-11-11 21:12:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:48,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 21:12:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:48,389 INFO L225 Difference]: With dead ends: 1475 [2024-11-11 21:12:48,389 INFO L226 Difference]: Without dead ends: 1083 [2024-11-11 21:12:48,390 INFO L434 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-11-11 21:12:48,391 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 72 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:48,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 383 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-11 21:12:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2024-11-11 21:12:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.6203703703703705) internal successors, (1750), 1080 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1750 transitions. [2024-11-11 21:12:48,416 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1750 transitions. Word has length 69 [2024-11-11 21:12:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:48,416 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1750 transitions. [2024-11-11 21:12:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1750 transitions. [2024-11-11 21:12:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:12:48,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:48,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:12:48,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 859687781, now seen corresponding path program 1 times [2024-11-11 21:12:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103596826] [2024-11-11 21:12:48,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103596826] [2024-11-11 21:12:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103596826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096741639] [2024-11-11 21:12:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:48,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:48,589 INFO L87 Difference]: Start difference. First operand 1081 states and 1750 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:48,815 INFO L93 Difference]: Finished difference Result 5482 states and 9073 transitions. [2024-11-11 21:12:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:12:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 21:12:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:48,836 INFO L225 Difference]: With dead ends: 5482 [2024-11-11 21:12:48,836 INFO L226 Difference]: Without dead ends: 4472 [2024-11-11 21:12:48,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:48,840 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 584 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1086 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2024-11-11 21:12:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 2024. [2024-11-11 21:12:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2023 states have (on average 1.6173999011369253) internal successors, (3272), 2023 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3272 transitions. [2024-11-11 21:12:48,922 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3272 transitions. Word has length 69 [2024-11-11 21:12:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:48,923 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3272 transitions. [2024-11-11 21:12:48,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3272 transitions. [2024-11-11 21:12:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:12:48,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:48,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:48,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:12:48,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1042315252, now seen corresponding path program 1 times [2024-11-11 21:12:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960246397] [2024-11-11 21:12:48,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960246397] [2024-11-11 21:12:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960246397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630538629] [2024-11-11 21:12:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:49,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:49,065 INFO L87 Difference]: Start difference. First operand 2024 states and 3272 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-11-11 21:12:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:49,177 INFO L93 Difference]: Finished difference Result 6607 states and 10831 transitions. [2024-11-11 21:12:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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 70 [2024-11-11 21:12:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:49,193 INFO L225 Difference]: With dead ends: 6607 [2024-11-11 21:12:49,193 INFO L226 Difference]: Without dead ends: 4654 [2024-11-11 21:12:49,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:49,199 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 284 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:49,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 495 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2024-11-11 21:12:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 3320. [2024-11-11 21:12:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.619764989454655) internal successors, (5376), 3319 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 5376 transitions. [2024-11-11 21:12:49,291 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 5376 transitions. Word has length 70 [2024-11-11 21:12:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:49,291 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 5376 transitions. [2024-11-11 21:12:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-11-11 21:12:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 5376 transitions. [2024-11-11 21:12:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:12:49,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:49,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:12:49,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 294137212, now seen corresponding path program 1 times [2024-11-11 21:12:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55831308] [2024-11-11 21:12:49,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55831308] [2024-11-11 21:12:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55831308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290099964] [2024-11-11 21:12:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:49,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:49,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:49,405 INFO L87 Difference]: Start difference. First operand 3320 states and 5376 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-11-11 21:12:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:49,579 INFO L93 Difference]: Finished difference Result 10675 states and 17375 transitions. [2024-11-11 21:12:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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 71 [2024-11-11 21:12:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:49,606 INFO L225 Difference]: With dead ends: 10675 [2024-11-11 21:12:49,607 INFO L226 Difference]: Without dead ends: 7426 [2024-11-11 21:12:49,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:49,615 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 282 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:49,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2024-11-11 21:12:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 5344. [2024-11-11 21:12:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.609208309938237) internal successors, (8598), 5343 states have internal predecessors, (8598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8598 transitions. [2024-11-11 21:12:49,794 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 8598 transitions. Word has length 71 [2024-11-11 21:12:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:49,795 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 8598 transitions. [2024-11-11 21:12:49,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-11-11 21:12:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 8598 transitions. [2024-11-11 21:12:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:12:49,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:49,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:12:49,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1056505021, now seen corresponding path program 1 times [2024-11-11 21:12:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977732959] [2024-11-11 21:12:49,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977732959] [2024-11-11 21:12:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977732959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:49,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:49,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797686421] [2024-11-11 21:12:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:49,940 INFO L87 Difference]: Start difference. First operand 5344 states and 8598 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-11-11 21:12:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:50,192 INFO L93 Difference]: Finished difference Result 16871 states and 27255 transitions. [2024-11-11 21:12:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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 72 [2024-11-11 21:12:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:50,242 INFO L225 Difference]: With dead ends: 16871 [2024-11-11 21:12:50,242 INFO L226 Difference]: Without dead ends: 11598 [2024-11-11 21:12:50,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:50,260 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 280 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 553 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11598 states. [2024-11-11 21:12:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 8428. [2024-11-11 21:12:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 8427 states have (on average 1.5981962738815711) internal successors, (13468), 8427 states have internal predecessors, (13468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13468 transitions. [2024-11-11 21:12:50,571 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 13468 transitions. Word has length 72 [2024-11-11 21:12:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 8428 states and 13468 transitions. [2024-11-11 21:12:50,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-11-11 21:12:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 13468 transitions. [2024-11-11 21:12:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:12:50,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:50,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:50,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:12:50,573 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:50,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 478401083, now seen corresponding path program 1 times [2024-11-11 21:12:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440072385] [2024-11-11 21:12:50,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:50,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440072385] [2024-11-11 21:12:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440072385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988253155] [2024-11-11 21:12:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:50,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:50,804 INFO L87 Difference]: Start difference. First operand 8428 states and 13468 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:51,051 INFO L93 Difference]: Finished difference Result 16787 states and 26844 transitions. [2024-11-11 21:12:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-11-11 21:12:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:51,069 INFO L225 Difference]: With dead ends: 16787 [2024-11-11 21:12:51,070 INFO L226 Difference]: Without dead ends: 8430 [2024-11-11 21:12:51,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:51,081 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 141 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:51,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 459 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2024-11-11 21:12:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 8428. [2024-11-11 21:12:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 8427 states have (on average 1.5833629998813339) internal successors, (13343), 8427 states have internal predecessors, (13343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13343 transitions. [2024-11-11 21:12:51,295 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 13343 transitions. Word has length 74 [2024-11-11 21:12:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 8428 states and 13343 transitions. [2024-11-11 21:12:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 13343 transitions. [2024-11-11 21:12:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:12:51,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:51,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:12:51,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1246891745, now seen corresponding path program 1 times [2024-11-11 21:12:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254711753] [2024-11-11 21:12:51,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254711753] [2024-11-11 21:12:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254711753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:51,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58959892] [2024-11-11 21:12:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:51,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:51,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:51,547 INFO L87 Difference]: Start difference. First operand 8428 states and 13343 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-11 21:12:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:51,806 INFO L93 Difference]: Finished difference Result 24145 states and 38378 transitions. [2024-11-11 21:12:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-11 21:12:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:51,839 INFO L225 Difference]: With dead ends: 24145 [2024-11-11 21:12:51,840 INFO L226 Difference]: Without dead ends: 15788 [2024-11-11 21:12:51,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:51,857 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 69 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:51,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 616 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15788 states. [2024-11-11 21:12:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15788 to 15786. [2024-11-11 21:12:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15786 states, 15785 states have (on average 1.5671840354767184) internal successors, (24738), 15785 states have internal predecessors, (24738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 24738 transitions. [2024-11-11 21:12:52,391 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 24738 transitions. Word has length 77 [2024-11-11 21:12:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:52,391 INFO L471 AbstractCegarLoop]: Abstraction has 15786 states and 24738 transitions. [2024-11-11 21:12:52,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-11-11 21:12:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 24738 transitions. [2024-11-11 21:12:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:12:52,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:52,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:52,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:12:52,393 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:52,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash -427514140, now seen corresponding path program 1 times [2024-11-11 21:12:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:52,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992670020] [2024-11-11 21:12:52,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:52,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992670020] [2024-11-11 21:12:52,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992670020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:52,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189634612] [2024-11-11 21:12:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:52,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:52,721 INFO L87 Difference]: Start difference. First operand 15786 states and 24738 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-11-11 21:12:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:52,910 INFO L93 Difference]: Finished difference Result 16874 states and 26187 transitions. [2024-11-11 21:12:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-11-11 21:12:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:52,947 INFO L225 Difference]: With dead ends: 16874 [2024-11-11 21:12:52,948 INFO L226 Difference]: Without dead ends: 16872 [2024-11-11 21:12:52,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:52,959 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:52,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16872 states. [2024-11-11 21:12:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16872 to 16872. [2024-11-11 21:12:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16872 states, 16871 states have (on average 1.5301404777428724) internal successors, (25815), 16871 states have internal predecessors, (25815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16872 states to 16872 states and 25815 transitions. [2024-11-11 21:12:53,388 INFO L78 Accepts]: Start accepts. Automaton has 16872 states and 25815 transitions. Word has length 78 [2024-11-11 21:12:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:53,388 INFO L471 AbstractCegarLoop]: Abstraction has 16872 states and 25815 transitions. [2024-11-11 21:12:53,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-11-11 21:12:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 16872 states and 25815 transitions. [2024-11-11 21:12:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:12:53,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:53,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:12:53,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1568556927, now seen corresponding path program 1 times [2024-11-11 21:12:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448743498] [2024-11-11 21:12:53,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448743498] [2024-11-11 21:12:53,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448743498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:53,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473812096] [2024-11-11 21:12:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:53,477 INFO L87 Difference]: Start difference. First operand 16872 states and 25815 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:53,958 INFO L93 Difference]: Finished difference Result 50355 states and 76975 transitions. [2024-11-11 21:12:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 21:12:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:54,035 INFO L225 Difference]: With dead ends: 50355 [2024-11-11 21:12:54,036 INFO L226 Difference]: Without dead ends: 33550 [2024-11-11 21:12:54,062 INFO L434 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-11-11 21:12:54,063 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:54,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 411 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33550 states. [2024-11-11 21:12:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33550 to 33548. [2024-11-11 21:12:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33548 states, 33547 states have (on average 1.5150982204071899) internal successors, (50827), 33547 states have internal predecessors, (50827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33548 states to 33548 states and 50827 transitions. [2024-11-11 21:12:55,037 INFO L78 Accepts]: Start accepts. Automaton has 33548 states and 50827 transitions. Word has length 103 [2024-11-11 21:12:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 33548 states and 50827 transitions. [2024-11-11 21:12:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33548 states and 50827 transitions. [2024-11-11 21:12:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:12:55,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:55,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:12:55,044 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1611929700, now seen corresponding path program 1 times [2024-11-11 21:12:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42935206] [2024-11-11 21:12:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:12:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42935206] [2024-11-11 21:12:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42935206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692672912] [2024-11-11 21:12:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:55,272 INFO L87 Difference]: Start difference. First operand 33548 states and 50827 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:56,041 INFO L93 Difference]: Finished difference Result 100168 states and 151615 transitions. [2024-11-11 21:12:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:56,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-11 21:12:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:56,233 INFO L225 Difference]: With dead ends: 100168 [2024-11-11 21:12:56,234 INFO L226 Difference]: Without dead ends: 66721 [2024-11-11 21:12:56,276 INFO L434 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-11-11 21:12:56,277 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66721 states. [2024-11-11 21:12:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66721 to 66719. [2024-11-11 21:12:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66719 states, 66718 states have (on average 1.49991006924668) internal successors, (100071), 66718 states have internal predecessors, (100071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66719 states to 66719 states and 100071 transitions. [2024-11-11 21:12:58,276 INFO L78 Accepts]: Start accepts. Automaton has 66719 states and 100071 transitions. Word has length 103 [2024-11-11 21:12:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,277 INFO L471 AbstractCegarLoop]: Abstraction has 66719 states and 100071 transitions. [2024-11-11 21:12:58,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 66719 states and 100071 transitions. [2024-11-11 21:12:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:12:58,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:12:58,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:12:58,286 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1885516983, now seen corresponding path program 1 times [2024-11-11 21:12:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236385558] [2024-11-11 21:12:58,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:12:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236385558] [2024-11-11 21:12:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236385558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369001102] [2024-11-11 21:12:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,383 INFO L87 Difference]: Start difference. First operand 66719 states and 100071 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:00,026 INFO L93 Difference]: Finished difference Result 199271 states and 298596 transitions. [2024-11-11 21:13:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:00,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-11 21:13:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:00,396 INFO L225 Difference]: With dead ends: 199271 [2024-11-11 21:13:00,397 INFO L226 Difference]: Without dead ends: 132729 [2024-11-11 21:13:00,466 INFO L434 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-11-11 21:13:00,467 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:00,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132729 states. [2024-11-11 21:13:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132729 to 132727. [2024-11-11 21:13:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132727 states, 132726 states have (on average 1.4846224552838179) internal successors, (197048), 132726 states have internal predecessors, (197048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132727 states to 132727 states and 197048 transitions. [2024-11-11 21:13:03,526 INFO L78 Accepts]: Start accepts. Automaton has 132727 states and 197048 transitions. Word has length 103 [2024-11-11 21:13:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:03,526 INFO L471 AbstractCegarLoop]: Abstraction has 132727 states and 197048 transitions. [2024-11-11 21:13:03,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 132727 states and 197048 transitions. [2024-11-11 21:13:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:03,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:03,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:13:03,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:13:03,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 891720263, now seen corresponding path program 1 times [2024-11-11 21:13:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676807988] [2024-11-11 21:13:03,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676807988] [2024-11-11 21:13:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676807988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:03,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091904684] [2024-11-11 21:13:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:03,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:03,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:03,622 INFO L87 Difference]: Start difference. First operand 132727 states and 197048 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:06,764 INFO L93 Difference]: Finished difference Result 396375 states and 587895 transitions. [2024-11-11 21:13:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:06,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:07,462 INFO L225 Difference]: With dead ends: 396375 [2024-11-11 21:13:07,462 INFO L226 Difference]: Without dead ends: 264057 [2024-11-11 21:13:07,580 INFO L434 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-11-11 21:13:07,581 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:07,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 417 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264057 states. [2024-11-11 21:13:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264057 to 264055. [2024-11-11 21:13:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264055 states, 264054 states have (on average 1.4692184174449165) internal successors, (387953), 264054 states have internal predecessors, (387953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264055 states to 264055 states and 387953 transitions. [2024-11-11 21:13:14,195 INFO L78 Accepts]: Start accepts. Automaton has 264055 states and 387953 transitions. Word has length 103 [2024-11-11 21:13:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:14,196 INFO L471 AbstractCegarLoop]: Abstraction has 264055 states and 387953 transitions. [2024-11-11 21:13:14,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 264055 states and 387953 transitions. [2024-11-11 21:13:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:14,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:14,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:13:14,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:13:14,216 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:14,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -5673015, now seen corresponding path program 1 times [2024-11-11 21:13:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794833258] [2024-11-11 21:13:14,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:13:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794833258] [2024-11-11 21:13:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794833258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:14,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910807266] [2024-11-11 21:13:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:14,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:14,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:14,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:14,294 INFO L87 Difference]: Start difference. First operand 264055 states and 387953 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:19,134 INFO L93 Difference]: Finished difference Result 557067 states and 823483 transitions. [2024-11-11 21:13:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:20,359 INFO L225 Difference]: With dead ends: 557067 [2024-11-11 21:13:20,360 INFO L226 Difference]: Without dead ends: 427145 [2024-11-11 21:13:20,486 INFO L434 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-11-11 21:13:20,487 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 60 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:20,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 314 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427145 states. [2024-11-11 21:13:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427145 to 426379. [2024-11-11 21:13:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426379 states, 426378 states have (on average 1.4696560329097654) internal successors, (626629), 426378 states have internal predecessors, (626629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426379 states to 426379 states and 626629 transitions. [2024-11-11 21:13:29,652 INFO L78 Accepts]: Start accepts. Automaton has 426379 states and 626629 transitions. Word has length 103 [2024-11-11 21:13:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:29,653 INFO L471 AbstractCegarLoop]: Abstraction has 426379 states and 626629 transitions. [2024-11-11 21:13:29,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 426379 states and 626629 transitions. [2024-11-11 21:13:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:29,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:29,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:13:29,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:13:29,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:29,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:29,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1110729481, now seen corresponding path program 1 times [2024-11-11 21:13:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407049012] [2024-11-11 21:13:29,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 21:13:29,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407049012] [2024-11-11 21:13:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407049012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872341687] [2024-11-11 21:13:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:29,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:29,767 INFO L87 Difference]: Start difference. First operand 426379 states and 626629 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)