./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 17:15:15,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:15:15,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:15:15,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:15:15,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:15:15,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:15:15,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:15:15,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:15:15,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:15:15,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:15:15,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:15:15,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:15:15,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:15:15,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:15:15,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:15:15,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:15:15,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:15:15,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:15:15,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:15:15,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:15:15,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:15:15,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:15:15,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:15:15,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:15:15,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:15:15,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:15:15,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:15:15,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:15:15,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:15:15,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:15:15,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:15:15,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:15:15,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:15:15,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:15:15,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:15:15,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:15:15,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:15:15,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:15:15,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:15:15,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:15:15,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:15:15,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:15:15,534 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-19 17:15:15,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:15:15,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:15:15,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:15:15,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:15:15,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:15:15,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-19 17:15:17,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:15:17,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:15:17,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-19 17:15:17,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d086b4bdc/eee21ea2fc2e41058383fb6140777c8f/FLAG3e32cba05 [2024-11-19 17:15:17,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d086b4bdc/eee21ea2fc2e41058383fb6140777c8f [2024-11-19 17:15:17,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:15:17,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:15:17,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:15:17,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:15:17,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:15:17,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508a854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17, skipping insertion in model container [2024-11-19 17:15:17,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:15:17,475 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/locks/test_locks_15-2.c[5628,5641] [2024-11-19 17:15:17,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:15:17,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:15:17,506 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/locks/test_locks_15-2.c[5628,5641] [2024-11-19 17:15:17,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:15:17,521 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:15:17,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17 WrapperNode [2024-11-19 17:15:17,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:15:17,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:15:17,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:15:17,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:15:17,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,550 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 208 [2024-11-19 17:15:17,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:15:17,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:15:17,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:15:17,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:15:17,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,576 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-19 17:15:17,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:15:17,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:15:17,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:15:17,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:15:17,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (1/1) ... [2024-11-19 17:15:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:15:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:15:17,614 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-19 17:15:17,616 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-19 17:15:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:15:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:15:17,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:15:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:15:17,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:15:17,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:15:17,944 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 17:15:17,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:15:17,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:15:17,954 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 17:15:17,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:17 BoogieIcfgContainer [2024-11-19 17:15:17,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:15:17,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:15:17,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:15:17,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:15:17,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:15:17" (1/3) ... [2024-11-19 17:15:17,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8ff3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:17, skipping insertion in model container [2024-11-19 17:15:17,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:17" (2/3) ... [2024-11-19 17:15:17,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8ff3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:17, skipping insertion in model container [2024-11-19 17:15:17,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:17" (3/3) ... [2024-11-19 17:15:17,961 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-19 17:15:17,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:15:17,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:15:18,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:15:18,019 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;@131d48d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:15:18,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:15:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 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-19 17:15:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 17:15:18,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2024-11-19 17:15:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138256823] [2024-11-19 17:15:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,265 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-19 17:15:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138256823] [2024-11-19 17:15:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138256823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086269778] [2024-11-19 17:15:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,286 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 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) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-19 17:15:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,316 INFO L93 Difference]: Finished difference Result 111 states and 204 transitions. [2024-11-19 17:15:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-19 17:15:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,324 INFO L225 Difference]: With dead ends: 111 [2024-11-19 17:15:18,324 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 17:15:18,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,328 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 17:15:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2024-11-19 17:15:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-19 17:15:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2024-11-19 17:15:18,353 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2024-11-19 17:15:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2024-11-19 17:15:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-19 17:15:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2024-11-19 17:15:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 17:15:18,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 17:15:18,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2024-11-19 17:15:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137411194] [2024-11-19 17:15:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,499 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-19 17:15:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137411194] [2024-11-19 17:15:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137411194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637742939] [2024-11-19 17:15:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,503 INFO L87 Difference]: Start difference. First operand 67 states and 126 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-19 17:15:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,523 INFO L93 Difference]: Finished difference Result 164 states and 309 transitions. [2024-11-19 17:15:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-19 17:15:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,525 INFO L225 Difference]: With dead ends: 164 [2024-11-19 17:15:18,525 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 17:15:18,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,526 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 17:15:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-19 17:15:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-19 17:15:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2024-11-19 17:15:18,534 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2024-11-19 17:15:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,534 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2024-11-19 17:15:18,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-19 17:15:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2024-11-19 17:15:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:18,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:15:18,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1809543287, now seen corresponding path program 1 times [2024-11-19 17:15:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869430527] [2024-11-19 17:15:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,613 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-19 17:15:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869430527] [2024-11-19 17:15:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869430527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155190054] [2024-11-19 17:15:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,616 INFO L87 Difference]: Start difference. First operand 97 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,644 INFO L93 Difference]: Finished difference Result 150 states and 276 transitions. [2024-11-19 17:15:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-19 17:15:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,649 INFO L225 Difference]: With dead ends: 150 [2024-11-19 17:15:18,649 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 17:15:18,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,650 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 17:15:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-19 17:15:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2024-11-19 17:15:18,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2024-11-19 17:15:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2024-11-19 17:15:18,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2024-11-19 17:15:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:15:18,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash 120599545, now seen corresponding path program 1 times [2024-11-19 17:15:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762181792] [2024-11-19 17:15:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,740 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-19 17:15:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762181792] [2024-11-19 17:15:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762181792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775459435] [2024-11-19 17:15:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,746 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,771 INFO L93 Difference]: Finished difference Result 193 states and 357 transitions. [2024-11-19 17:15:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-19 17:15:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,773 INFO L225 Difference]: With dead ends: 193 [2024-11-19 17:15:18,776 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 17:15:18,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,778 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 17:15:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2024-11-19 17:15:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 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-19 17:15:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2024-11-19 17:15:18,795 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2024-11-19 17:15:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,795 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2024-11-19 17:15:18,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2024-11-19 17:15:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:18,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 17:15:18,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1873545161, now seen corresponding path program 1 times [2024-11-19 17:15:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104278322] [2024-11-19 17:15:18,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,851 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-19 17:15:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104278322] [2024-11-19 17:15:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104278322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418525247] [2024-11-19 17:15:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,854 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,866 INFO L93 Difference]: Finished difference Result 321 states and 595 transitions. [2024-11-19 17:15:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-19 17:15:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,868 INFO L225 Difference]: With dead ends: 321 [2024-11-19 17:15:18,868 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 17:15:18,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,870 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 17:15:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-19 17:15:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-19 17:15:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2024-11-19 17:15:18,886 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2024-11-19 17:15:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2024-11-19 17:15:18,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-19 17:15:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2024-11-19 17:15:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 17:15:18,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 17:15:18,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash -556169332, now seen corresponding path program 1 times [2024-11-19 17:15:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580921783] [2024-11-19 17:15:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,938 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-19 17:15:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580921783] [2024-11-19 17:15:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580921783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76145985] [2024-11-19 17:15:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,943 INFO L87 Difference]: Start difference. First operand 191 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,962 INFO L93 Difference]: Finished difference Result 288 states and 526 transitions. [2024-11-19 17:15:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-19 17:15:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,963 INFO L225 Difference]: With dead ends: 288 [2024-11-19 17:15:18,964 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 17:15:18,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,965 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:18,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 17:15:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2024-11-19 17:15:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-19 17:15:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2024-11-19 17:15:18,980 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2024-11-19 17:15:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2024-11-19 17:15:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2024-11-19 17:15:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 17:15:18,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:18,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 17:15:18,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2049854222, now seen corresponding path program 1 times [2024-11-19 17:15:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664381075] [2024-11-19 17:15:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,020 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-19 17:15:19,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664381075] [2024-11-19 17:15:19,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664381075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964510077] [2024-11-19 17:15:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,023 INFO L87 Difference]: Start difference. First operand 193 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,038 INFO L93 Difference]: Finished difference Result 561 states and 1025 transitions. [2024-11-19 17:15:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-19 17:15:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,040 INFO L225 Difference]: With dead ends: 561 [2024-11-19 17:15:19,040 INFO L226 Difference]: Without dead ends: 375 [2024-11-19 17:15:19,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,043 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-19 17:15:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2024-11-19 17:15:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 675 transitions. [2024-11-19 17:15:19,052 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 675 transitions. Word has length 24 [2024-11-19 17:15:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,053 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 675 transitions. [2024-11-19 17:15:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 675 transitions. [2024-11-19 17:15:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 17:15:19,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:15:19,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash -250968368, now seen corresponding path program 1 times [2024-11-19 17:15:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131240529] [2024-11-19 17:15:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,077 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-19 17:15:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131240529] [2024-11-19 17:15:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131240529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476667650] [2024-11-19 17:15:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,081 INFO L87 Difference]: Start difference. First operand 373 states and 675 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,094 INFO L93 Difference]: Finished difference Result 481 states and 877 transitions. [2024-11-19 17:15:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-19 17:15:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,096 INFO L225 Difference]: With dead ends: 481 [2024-11-19 17:15:19,096 INFO L226 Difference]: Without dead ends: 479 [2024-11-19 17:15:19,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,098 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-19 17:15:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 373. [2024-11-19 17:15:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2024-11-19 17:15:19,109 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2024-11-19 17:15:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,109 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2024-11-19 17:15:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 17:15:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2024-11-19 17:15:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 17:15:19,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 17:15:19,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash -878816148, now seen corresponding path program 1 times [2024-11-19 17:15:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810672097] [2024-11-19 17:15:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,137 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-19 17:15:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810672097] [2024-11-19 17:15:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810672097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033313235] [2024-11-19 17:15:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,139 INFO L87 Difference]: Start difference. First operand 373 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 17:15:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,154 INFO L93 Difference]: Finished difference Result 709 states and 1289 transitions. [2024-11-19 17:15:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-19 17:15:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,157 INFO L225 Difference]: With dead ends: 709 [2024-11-19 17:15:19,157 INFO L226 Difference]: Without dead ends: 707 [2024-11-19 17:15:19,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,158 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-19 17:15:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 513. [2024-11-19 17:15:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 0 states have call successors, (0), 0 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-19 17:15:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 911 transitions. [2024-11-19 17:15:19,168 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 911 transitions. Word has length 25 [2024-11-19 17:15:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,171 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 911 transitions. [2024-11-19 17:15:19,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 17:15:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 911 transitions. [2024-11-19 17:15:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 17:15:19,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 17:15:19,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1422006442, now seen corresponding path program 1 times [2024-11-19 17:15:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319725256] [2024-11-19 17:15:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,192 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-19 17:15:19,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319725256] [2024-11-19 17:15:19,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319725256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008271368] [2024-11-19 17:15:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,194 INFO L87 Difference]: Start difference. First operand 513 states and 911 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 17:15:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,209 INFO L93 Difference]: Finished difference Result 1237 states and 2209 transitions. [2024-11-19 17:15:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-19 17:15:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,212 INFO L225 Difference]: With dead ends: 1237 [2024-11-19 17:15:19,212 INFO L226 Difference]: Without dead ends: 731 [2024-11-19 17:15:19,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,214 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-19 17:15:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-11-19 17:15:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 0 states have call successors, (0), 0 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-19 17:15:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1291 transitions. [2024-11-19 17:15:19,226 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1291 transitions. Word has length 25 [2024-11-19 17:15:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1291 transitions. [2024-11-19 17:15:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-19 17:15:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1291 transitions. [2024-11-19 17:15:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:19,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 17:15:19,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1473284061, now seen corresponding path program 1 times [2024-11-19 17:15:19,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021394852] [2024-11-19 17:15:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,264 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-19 17:15:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021394852] [2024-11-19 17:15:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021394852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486176087] [2024-11-19 17:15:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,268 INFO L87 Difference]: Start difference. First operand 729 states and 1291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,285 INFO L93 Difference]: Finished difference Result 1101 states and 1945 transitions. [2024-11-19 17:15:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 17:15:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,288 INFO L225 Difference]: With dead ends: 1101 [2024-11-19 17:15:19,288 INFO L226 Difference]: Without dead ends: 743 [2024-11-19 17:15:19,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,290 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-19 17:15:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2024-11-19 17:15:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 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-19 17:15:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1299 transitions. [2024-11-19 17:15:19,305 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1299 transitions. Word has length 26 [2024-11-19 17:15:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,305 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1299 transitions. [2024-11-19 17:15:19,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1299 transitions. [2024-11-19 17:15:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:19,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 17:15:19,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1132739493, now seen corresponding path program 1 times [2024-11-19 17:15:19,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967696396] [2024-11-19 17:15:19,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,342 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-19 17:15:19,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967696396] [2024-11-19 17:15:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967696396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471033414] [2024-11-19 17:15:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,345 INFO L87 Difference]: Start difference. First operand 741 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,363 INFO L93 Difference]: Finished difference Result 1385 states and 2461 transitions. [2024-11-19 17:15:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 17:15:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,367 INFO L225 Difference]: With dead ends: 1385 [2024-11-19 17:15:19,369 INFO L226 Difference]: Without dead ends: 1383 [2024-11-19 17:15:19,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,370 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-19 17:15:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2024-11-19 17:15:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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-19 17:15:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1771 transitions. [2024-11-19 17:15:19,387 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1771 transitions. Word has length 26 [2024-11-19 17:15:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1771 transitions. [2024-11-19 17:15:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1771 transitions. [2024-11-19 17:15:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:19,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 17:15:19,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash -861405213, now seen corresponding path program 1 times [2024-11-19 17:15:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884865997] [2024-11-19 17:15:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,412 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-19 17:15:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884865997] [2024-11-19 17:15:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884865997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923951634] [2024-11-19 17:15:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,413 INFO L87 Difference]: Start difference. First operand 1029 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,438 INFO L93 Difference]: Finished difference Result 2457 states and 4253 transitions. [2024-11-19 17:15:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 17:15:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,441 INFO L225 Difference]: With dead ends: 2457 [2024-11-19 17:15:19,441 INFO L226 Difference]: Without dead ends: 1447 [2024-11-19 17:15:19,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,443 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-19 17:15:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2024-11-19 17:15:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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-19 17:15:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2483 transitions. [2024-11-19 17:15:19,467 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2483 transitions. Word has length 26 [2024-11-19 17:15:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,468 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2483 transitions. [2024-11-19 17:15:19,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2483 transitions. [2024-11-19 17:15:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:19,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 17:15:19,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 755399007, now seen corresponding path program 1 times [2024-11-19 17:15:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405123903] [2024-11-19 17:15:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,495 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-19 17:15:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405123903] [2024-11-19 17:15:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405123903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206424018] [2024-11-19 17:15:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,497 INFO L87 Difference]: Start difference. First operand 1445 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,519 INFO L93 Difference]: Finished difference Result 2169 states and 3717 transitions. [2024-11-19 17:15:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-19 17:15:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,522 INFO L225 Difference]: With dead ends: 2169 [2024-11-19 17:15:19,523 INFO L226 Difference]: Without dead ends: 1463 [2024-11-19 17:15:19,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,524 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2024-11-19 17:15:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2024-11-19 17:15:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 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-19 17:15:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2483 transitions. [2024-11-19 17:15:19,549 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2483 transitions. Word has length 27 [2024-11-19 17:15:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,549 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2483 transitions. [2024-11-19 17:15:19,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2483 transitions. [2024-11-19 17:15:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:19,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 17:15:19,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash -933544735, now seen corresponding path program 1 times [2024-11-19 17:15:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642487666] [2024-11-19 17:15:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,570 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-19 17:15:19,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642487666] [2024-11-19 17:15:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642487666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839214442] [2024-11-19 17:15:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,572 INFO L87 Difference]: Start difference. First operand 1461 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,609 INFO L93 Difference]: Finished difference Result 2697 states and 4661 transitions. [2024-11-19 17:15:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-19 17:15:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,615 INFO L225 Difference]: With dead ends: 2697 [2024-11-19 17:15:19,616 INFO L226 Difference]: Without dead ends: 2695 [2024-11-19 17:15:19,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,617 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-19 17:15:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2024-11-19 17:15:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 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-19 17:15:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3411 transitions. [2024-11-19 17:15:19,652 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3411 transitions. Word has length 27 [2024-11-19 17:15:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,652 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3411 transitions. [2024-11-19 17:15:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3411 transitions. [2024-11-19 17:15:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:19,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 17:15:19,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1367277855, now seen corresponding path program 1 times [2024-11-19 17:15:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351416722] [2024-11-19 17:15:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,679 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-19 17:15:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351416722] [2024-11-19 17:15:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351416722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003550771] [2024-11-19 17:15:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,682 INFO L87 Difference]: Start difference. First operand 2053 states and 3411 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,720 INFO L93 Difference]: Finished difference Result 4873 states and 8149 transitions. [2024-11-19 17:15:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-19 17:15:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,727 INFO L225 Difference]: With dead ends: 4873 [2024-11-19 17:15:19,727 INFO L226 Difference]: Without dead ends: 2855 [2024-11-19 17:15:19,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,729 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-11-19 17:15:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2024-11-19 17:15:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 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-19 17:15:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4739 transitions. [2024-11-19 17:15:19,776 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4739 transitions. Word has length 27 [2024-11-19 17:15:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,776 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4739 transitions. [2024-11-19 17:15:19,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 17:15:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4739 transitions. [2024-11-19 17:15:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:19,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 17:15:19,778 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1125097720, now seen corresponding path program 1 times [2024-11-19 17:15:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700341782] [2024-11-19 17:15:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,799 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-19 17:15:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700341782] [2024-11-19 17:15:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700341782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056378153] [2024-11-19 17:15:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,800 INFO L87 Difference]: Start difference. First operand 2853 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,862 INFO L93 Difference]: Finished difference Result 4281 states and 7093 transitions. [2024-11-19 17:15:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-19 17:15:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,869 INFO L225 Difference]: With dead ends: 4281 [2024-11-19 17:15:19,869 INFO L226 Difference]: Without dead ends: 2887 [2024-11-19 17:15:19,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,870 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:19,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2024-11-19 17:15:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2024-11-19 17:15:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 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-19 17:15:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4739 transitions. [2024-11-19 17:15:19,926 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4739 transitions. Word has length 28 [2024-11-19 17:15:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4739 transitions. [2024-11-19 17:15:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4739 transitions. [2024-11-19 17:15:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:19,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 17:15:19,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash -563846022, now seen corresponding path program 1 times [2024-11-19 17:15:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614011734] [2024-11-19 17:15:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,947 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-19 17:15:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614011734] [2024-11-19 17:15:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614011734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555395594] [2024-11-19 17:15:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,948 INFO L87 Difference]: Start difference. First operand 2885 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:20,003 INFO L93 Difference]: Finished difference Result 5257 states and 8805 transitions. [2024-11-19 17:15:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-19 17:15:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:20,017 INFO L225 Difference]: With dead ends: 5257 [2024-11-19 17:15:20,017 INFO L226 Difference]: Without dead ends: 5255 [2024-11-19 17:15:20,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,019 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:20,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-19 17:15:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2024-11-19 17:15:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 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-19 17:15:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6563 transitions. [2024-11-19 17:15:20,131 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6563 transitions. Word has length 28 [2024-11-19 17:15:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:20,132 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6563 transitions. [2024-11-19 17:15:20,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6563 transitions. [2024-11-19 17:15:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:20,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:20,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:20,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 17:15:20,136 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:20,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1736976568, now seen corresponding path program 1 times [2024-11-19 17:15:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458208835] [2024-11-19 17:15:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:20,157 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-19 17:15:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458208835] [2024-11-19 17:15:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458208835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:20,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853000346] [2024-11-19 17:15:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:20,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:20,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,160 INFO L87 Difference]: Start difference. First operand 4101 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:20,246 INFO L93 Difference]: Finished difference Result 9673 states and 15589 transitions. [2024-11-19 17:15:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-19 17:15:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:20,267 INFO L225 Difference]: With dead ends: 9673 [2024-11-19 17:15:20,270 INFO L226 Difference]: Without dead ends: 5639 [2024-11-19 17:15:20,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,276 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:20,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2024-11-19 17:15:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2024-11-19 17:15:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 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-19 17:15:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 9027 transitions. [2024-11-19 17:15:20,454 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 9027 transitions. Word has length 28 [2024-11-19 17:15:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:20,454 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 9027 transitions. [2024-11-19 17:15:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-19 17:15:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 9027 transitions. [2024-11-19 17:15:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:20,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:20,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 17:15:20,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash -299143724, now seen corresponding path program 1 times [2024-11-19 17:15:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553707863] [2024-11-19 17:15:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:20,474 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-19 17:15:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553707863] [2024-11-19 17:15:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553707863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166321380] [2024-11-19 17:15:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,476 INFO L87 Difference]: Start difference. First operand 5637 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:20,536 INFO L93 Difference]: Finished difference Result 8457 states and 13509 transitions. [2024-11-19 17:15:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 17:15:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:20,545 INFO L225 Difference]: With dead ends: 8457 [2024-11-19 17:15:20,545 INFO L226 Difference]: Without dead ends: 5703 [2024-11-19 17:15:20,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,549 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:20,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-11-19 17:15:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2024-11-19 17:15:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 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-19 17:15:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9027 transitions. [2024-11-19 17:15:20,662 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9027 transitions. Word has length 29 [2024-11-19 17:15:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 9027 transitions. [2024-11-19 17:15:20,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9027 transitions. [2024-11-19 17:15:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:20,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:20,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:20,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 17:15:20,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1988087466, now seen corresponding path program 1 times [2024-11-19 17:15:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289922035] [2024-11-19 17:15:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:20,713 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-19 17:15:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289922035] [2024-11-19 17:15:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289922035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946789084] [2024-11-19 17:15:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,714 INFO L87 Difference]: Start difference. First operand 5701 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:20,815 INFO L93 Difference]: Finished difference Result 10249 states and 16581 transitions. [2024-11-19 17:15:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 17:15:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:20,830 INFO L225 Difference]: With dead ends: 10249 [2024-11-19 17:15:20,830 INFO L226 Difference]: Without dead ends: 10247 [2024-11-19 17:15:20,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:20,833 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:20,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2024-11-19 17:15:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2024-11-19 17:15:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 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-19 17:15:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12611 transitions. [2024-11-19 17:15:21,007 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12611 transitions. Word has length 29 [2024-11-19 17:15:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 12611 transitions. [2024-11-19 17:15:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12611 transitions. [2024-11-19 17:15:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:21,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:21,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:21,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 17:15:21,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 312735124, now seen corresponding path program 1 times [2024-11-19 17:15:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8923957] [2024-11-19 17:15:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:21,029 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-19 17:15:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8923957] [2024-11-19 17:15:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8923957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:21,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170331740] [2024-11-19 17:15:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:21,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,031 INFO L87 Difference]: Start difference. First operand 8197 states and 12611 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:21,191 INFO L93 Difference]: Finished difference Result 19209 states and 29765 transitions. [2024-11-19 17:15:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-19 17:15:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:21,206 INFO L225 Difference]: With dead ends: 19209 [2024-11-19 17:15:21,207 INFO L226 Difference]: Without dead ends: 11143 [2024-11-19 17:15:21,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,216 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:21,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2024-11-19 17:15:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2024-11-19 17:15:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 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-19 17:15:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17155 transitions. [2024-11-19 17:15:21,490 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17155 transitions. Word has length 29 [2024-11-19 17:15:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:21,490 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 17155 transitions. [2024-11-19 17:15:21,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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-19 17:15:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17155 transitions. [2024-11-19 17:15:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:21,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:21,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:21,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 17:15:21,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:21,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1500955187, now seen corresponding path program 1 times [2024-11-19 17:15:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927707953] [2024-11-19 17:15:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:21,521 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-19 17:15:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927707953] [2024-11-19 17:15:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927707953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45752702] [2024-11-19 17:15:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,523 INFO L87 Difference]: Start difference. First operand 11141 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:21,687 INFO L93 Difference]: Finished difference Result 16713 states and 25669 transitions. [2024-11-19 17:15:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-19 17:15:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:21,701 INFO L225 Difference]: With dead ends: 16713 [2024-11-19 17:15:21,701 INFO L226 Difference]: Without dead ends: 11271 [2024-11-19 17:15:21,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,706 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:21,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2024-11-19 17:15:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2024-11-19 17:15:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.522452964146255) internal successors, (17155), 11268 states have internal predecessors, (17155), 0 states have call successors, (0), 0 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-19 17:15:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17155 transitions. [2024-11-19 17:15:21,884 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17155 transitions. Word has length 30 [2024-11-19 17:15:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:21,884 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17155 transitions. [2024-11-19 17:15:21,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17155 transitions. [2024-11-19 17:15:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:21,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:21,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:21,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 17:15:21,890 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:21,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1105068367, now seen corresponding path program 1 times [2024-11-19 17:15:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:21,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866019378] [2024-11-19 17:15:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:21,908 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-19 17:15:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866019378] [2024-11-19 17:15:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866019378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:21,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:21,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565250068] [2024-11-19 17:15:21,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:21,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,910 INFO L87 Difference]: Start difference. First operand 11269 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:22,144 INFO L93 Difference]: Finished difference Result 19977 states and 31109 transitions. [2024-11-19 17:15:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-19 17:15:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:22,169 INFO L225 Difference]: With dead ends: 19977 [2024-11-19 17:15:22,169 INFO L226 Difference]: Without dead ends: 19975 [2024-11-19 17:15:22,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:22,173 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:22,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2024-11-19 17:15:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16389. [2024-11-19 17:15:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16389 states, 16388 states have (on average 1.476385159873078) internal successors, (24195), 16388 states have internal predecessors, (24195), 0 states have call successors, (0), 0 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-19 17:15:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16389 states to 16389 states and 24195 transitions. [2024-11-19 17:15:22,561 INFO L78 Accepts]: Start accepts. Automaton has 16389 states and 24195 transitions. Word has length 30 [2024-11-19 17:15:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:22,561 INFO L471 AbstractCegarLoop]: Abstraction has 16389 states and 24195 transitions. [2024-11-19 17:15:22,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 16389 states and 24195 transitions. [2024-11-19 17:15:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:22,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:22,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:22,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 17:15:22,572 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash -889076339, now seen corresponding path program 1 times [2024-11-19 17:15:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037903549] [2024-11-19 17:15:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:22,594 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-19 17:15:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:22,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037903549] [2024-11-19 17:15:22,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037903549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:22,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073175769] [2024-11-19 17:15:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:22,596 INFO L87 Difference]: Start difference. First operand 16389 states and 24195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:22,872 INFO L93 Difference]: Finished difference Result 38153 states and 56709 transitions. [2024-11-19 17:15:22,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-19 17:15:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:22,906 INFO L225 Difference]: With dead ends: 38153 [2024-11-19 17:15:22,907 INFO L226 Difference]: Without dead ends: 22023 [2024-11-19 17:15:22,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:22,925 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:22,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2024-11-19 17:15:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2024-11-19 17:15:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4766121707538602) internal successors, (32515), 22020 states have internal predecessors, (32515), 0 states have call successors, (0), 0 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-19 17:15:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32515 transitions. [2024-11-19 17:15:23,341 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32515 transitions. Word has length 30 [2024-11-19 17:15:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:23,341 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32515 transitions. [2024-11-19 17:15:23,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-19 17:15:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32515 transitions. [2024-11-19 17:15:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:23,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:23,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 17:15:23,353 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -102404535, now seen corresponding path program 1 times [2024-11-19 17:15:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650975689] [2024-11-19 17:15:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:23,372 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-19 17:15:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650975689] [2024-11-19 17:15:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650975689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720206107] [2024-11-19 17:15:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:23,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:23,375 INFO L87 Difference]: Start difference. First operand 22021 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:23,724 INFO L93 Difference]: Finished difference Result 33033 states and 48645 transitions. [2024-11-19 17:15:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:23,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 17:15:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:23,759 INFO L225 Difference]: With dead ends: 33033 [2024-11-19 17:15:23,759 INFO L226 Difference]: Without dead ends: 22279 [2024-11-19 17:15:23,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:23,771 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:23,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22279 states. [2024-11-19 17:15:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22279 to 22277. [2024-11-19 17:15:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4596426647513019) internal successors, (32515), 22276 states have internal predecessors, (32515), 0 states have call successors, (0), 0 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-19 17:15:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32515 transitions. [2024-11-19 17:15:24,196 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32515 transitions. Word has length 31 [2024-11-19 17:15:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:24,196 INFO L471 AbstractCegarLoop]: Abstraction has 22277 states and 32515 transitions. [2024-11-19 17:15:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32515 transitions. [2024-11-19 17:15:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:24,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:24,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 17:15:24,208 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1791348277, now seen corresponding path program 1 times [2024-11-19 17:15:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861487235] [2024-11-19 17:15:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:24,227 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-19 17:15:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861487235] [2024-11-19 17:15:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861487235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:24,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:24,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905810961] [2024-11-19 17:15:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:24,229 INFO L87 Difference]: Start difference. First operand 22277 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:24,594 INFO L93 Difference]: Finished difference Result 38921 states and 58117 transitions. [2024-11-19 17:15:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 17:15:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:24,635 INFO L225 Difference]: With dead ends: 38921 [2024-11-19 17:15:24,636 INFO L226 Difference]: Without dead ends: 38919 [2024-11-19 17:15:24,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:24,641 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:24,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38919 states. [2024-11-19 17:15:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38919 to 32773. [2024-11-19 17:15:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.4139814475772001) internal successors, (46339), 32772 states have internal predecessors, (46339), 0 states have call successors, (0), 0 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-19 17:15:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 46339 transitions. [2024-11-19 17:15:25,332 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 46339 transitions. Word has length 31 [2024-11-19 17:15:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:25,333 INFO L471 AbstractCegarLoop]: Abstraction has 32773 states and 46339 transitions. [2024-11-19 17:15:25,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 46339 transitions. [2024-11-19 17:15:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:25,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:25,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:25,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 17:15:25,347 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:25,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 509474313, now seen corresponding path program 1 times [2024-11-19 17:15:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207836735] [2024-11-19 17:15:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:15:25,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:25,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207836735] [2024-11-19 17:15:25,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207836735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:25,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:25,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352063868] [2024-11-19 17:15:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:25,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:25,362 INFO L87 Difference]: Start difference. First operand 32773 states and 46339 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:25,771 INFO L93 Difference]: Finished difference Result 75785 states and 107781 transitions. [2024-11-19 17:15:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 17:15:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:25,813 INFO L225 Difference]: With dead ends: 75785 [2024-11-19 17:15:25,814 INFO L226 Difference]: Without dead ends: 43527 [2024-11-19 17:15:25,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:25,834 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:25,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43527 states. [2024-11-19 17:15:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43527 to 43525. [2024-11-19 17:15:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.4117038875103392) internal successors, (61443), 43524 states have internal predecessors, (61443), 0 states have call successors, (0), 0 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-19 17:15:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 61443 transitions. [2024-11-19 17:15:26,670 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 61443 transitions. Word has length 31 [2024-11-19 17:15:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:26,671 INFO L471 AbstractCegarLoop]: Abstraction has 43525 states and 61443 transitions. [2024-11-19 17:15:26,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 61443 transitions. [2024-11-19 17:15:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 17:15:26,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:26,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 17:15:26,691 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 302993058, now seen corresponding path program 1 times [2024-11-19 17:15:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084127628] [2024-11-19 17:15:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:26,710 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-19 17:15:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084127628] [2024-11-19 17:15:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084127628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663029426] [2024-11-19 17:15:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:26,712 INFO L87 Difference]: Start difference. First operand 43525 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:27,230 INFO L93 Difference]: Finished difference Result 65289 states and 91909 transitions. [2024-11-19 17:15:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 17:15:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:27,270 INFO L225 Difference]: With dead ends: 65289 [2024-11-19 17:15:27,270 INFO L226 Difference]: Without dead ends: 44039 [2024-11-19 17:15:27,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:27,287 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:27,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2024-11-19 17:15:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2024-11-19 17:15:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.395290217095104) internal successors, (61443), 44036 states have internal predecessors, (61443), 0 states have call successors, (0), 0 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-19 17:15:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 61443 transitions. [2024-11-19 17:15:27,963 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 61443 transitions. Word has length 32 [2024-11-19 17:15:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:27,964 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 61443 transitions. [2024-11-19 17:15:27,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 61443 transitions. [2024-11-19 17:15:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 17:15:27,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:27,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 17:15:27,979 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1385950684, now seen corresponding path program 1 times [2024-11-19 17:15:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808767945] [2024-11-19 17:15:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:27,994 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-19 17:15:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808767945] [2024-11-19 17:15:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808767945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:27,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969366677] [2024-11-19 17:15:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:27,996 INFO L87 Difference]: Start difference. First operand 44037 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:28,980 INFO L93 Difference]: Finished difference Result 129033 states and 178181 transitions. [2024-11-19 17:15:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 17:15:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:29,086 INFO L225 Difference]: With dead ends: 129033 [2024-11-19 17:15:29,086 INFO L226 Difference]: Without dead ends: 86023 [2024-11-19 17:15:29,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:29,126 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:29,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2024-11-19 17:15:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2024-11-19 17:15:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.357114624505929) internal successors, (116739), 86020 states have internal predecessors, (116739), 0 states have call successors, (0), 0 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-19 17:15:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 116739 transitions. [2024-11-19 17:15:30,552 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 116739 transitions. Word has length 32 [2024-11-19 17:15:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:30,553 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 116739 transitions. [2024-11-19 17:15:30,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 116739 transitions. [2024-11-19 17:15:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 17:15:30,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:30,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:30,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 17:15:30,584 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:30,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 608194022, now seen corresponding path program 1 times [2024-11-19 17:15:30,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469199850] [2024-11-19 17:15:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:30,599 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-19 17:15:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469199850] [2024-11-19 17:15:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469199850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:30,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582555282] [2024-11-19 17:15:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:30,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:30,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:30,600 INFO L87 Difference]: Start difference. First operand 86021 states and 116739 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:31,847 INFO L93 Difference]: Finished difference Result 96265 states and 135173 transitions. [2024-11-19 17:15:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:31,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-19 17:15:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:31,948 INFO L225 Difference]: With dead ends: 96265 [2024-11-19 17:15:31,948 INFO L226 Difference]: Without dead ends: 96263 [2024-11-19 17:15:31,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:31,966 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:31,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96263 states. [2024-11-19 17:15:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96263 to 86021. [2024-11-19 17:15:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.345210416182283) internal successors, (115715), 86020 states have internal predecessors, (115715), 0 states have call successors, (0), 0 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-19 17:15:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 115715 transitions. [2024-11-19 17:15:33,553 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 115715 transitions. Word has length 32 [2024-11-19 17:15:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:33,553 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 115715 transitions. [2024-11-19 17:15:33,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-19 17:15:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 115715 transitions. [2024-11-19 17:15:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 17:15:33,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:33,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 17:15:33,581 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash -14583106, now seen corresponding path program 1 times [2024-11-19 17:15:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470215770] [2024-11-19 17:15:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:15:33,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:33,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470215770] [2024-11-19 17:15:33,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470215770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872050583] [2024-11-19 17:15:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:33,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:33,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:33,598 INFO L87 Difference]: Start difference. First operand 86021 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:35,393 INFO L93 Difference]: Finished difference Result 146441 states and 200709 transitions. [2024-11-19 17:15:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 17:15:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:35,608 INFO L225 Difference]: With dead ends: 146441 [2024-11-19 17:15:35,608 INFO L226 Difference]: Without dead ends: 146439 [2024-11-19 17:15:35,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:35,634 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:35,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146439 states. [2024-11-19 17:15:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146439 to 130053. [2024-11-19 17:15:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130053 states, 130052 states have (on average 1.3070694799003475) internal successors, (169987), 130052 states have internal predecessors, (169987), 0 states have call successors, (0), 0 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-19 17:15:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130053 states to 130053 states and 169987 transitions. [2024-11-19 17:15:37,758 INFO L78 Accepts]: Start accepts. Automaton has 130053 states and 169987 transitions. Word has length 33 [2024-11-19 17:15:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:37,758 INFO L471 AbstractCegarLoop]: Abstraction has 130053 states and 169987 transitions. [2024-11-19 17:15:37,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 130053 states and 169987 transitions. [2024-11-19 17:15:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 17:15:37,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:37,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:37,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 17:15:37,815 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2008727812, now seen corresponding path program 1 times [2024-11-19 17:15:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457250255] [2024-11-19 17:15:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:37,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:37,856 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-19 17:15:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457250255] [2024-11-19 17:15:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457250255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622848915] [2024-11-19 17:15:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:37,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:37,858 INFO L87 Difference]: Start difference. First operand 130053 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:40,388 INFO L93 Difference]: Finished difference Result 297993 states and 391173 transitions. [2024-11-19 17:15:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:40,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 17:15:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:40,705 INFO L225 Difference]: With dead ends: 297993 [2024-11-19 17:15:40,705 INFO L226 Difference]: Without dead ends: 168967 [2024-11-19 17:15:40,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:40,797 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:40,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168967 states. [2024-11-19 17:15:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168967 to 168965. [2024-11-19 17:15:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168965 states, 168964 states have (on average 1.2969567481830448) internal successors, (219139), 168964 states have internal predecessors, (219139), 0 states have call successors, (0), 0 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-19 17:15:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168965 states to 168965 states and 219139 transitions. [2024-11-19 17:15:44,627 INFO L78 Accepts]: Start accepts. Automaton has 168965 states and 219139 transitions. Word has length 33 [2024-11-19 17:15:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:44,628 INFO L471 AbstractCegarLoop]: Abstraction has 168965 states and 219139 transitions. [2024-11-19 17:15:44,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 168965 states and 219139 transitions. [2024-11-19 17:15:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 17:15:44,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:44,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:44,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 17:15:44,696 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:44,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash -451860807, now seen corresponding path program 1 times [2024-11-19 17:15:44,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:44,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492824810] [2024-11-19 17:15:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:15:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492824810] [2024-11-19 17:15:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492824810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195943408] [2024-11-19 17:15:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:44,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:44,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:44,713 INFO L87 Difference]: Start difference. First operand 168965 states and 219139 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:46,526 INFO L93 Difference]: Finished difference Result 254985 states and 330757 transitions. [2024-11-19 17:15:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 17:15:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:46,693 INFO L225 Difference]: With dead ends: 254985 [2024-11-19 17:15:46,694 INFO L226 Difference]: Without dead ends: 172039 [2024-11-19 17:15:46,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:46,768 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:46,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172039 states. [2024-11-19 17:15:49,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172039 to 172037. [2024-11-19 17:15:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172037 states, 172036 states have (on average 1.2857018298495664) internal successors, (221187), 172036 states have internal predecessors, (221187), 0 states have call successors, (0), 0 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-19 17:15:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172037 states to 172037 states and 221187 transitions. [2024-11-19 17:15:50,438 INFO L78 Accepts]: Start accepts. Automaton has 172037 states and 221187 transitions. Word has length 34 [2024-11-19 17:15:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:50,439 INFO L471 AbstractCegarLoop]: Abstraction has 172037 states and 221187 transitions. [2024-11-19 17:15:50,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 172037 states and 221187 transitions. [2024-11-19 17:15:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 17:15:50,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:50,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 17:15:50,543 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2140804549, now seen corresponding path program 1 times [2024-11-19 17:15:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008486809] [2024-11-19 17:15:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:50,570 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-19 17:15:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008486809] [2024-11-19 17:15:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008486809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:50,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232111477] [2024-11-19 17:15:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:50,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:50,571 INFO L87 Difference]: Start difference. First operand 172037 states and 221187 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:53,265 INFO L93 Difference]: Finished difference Result 286729 states and 372741 transitions. [2024-11-19 17:15:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 17:15:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:53,608 INFO L225 Difference]: With dead ends: 286729 [2024-11-19 17:15:53,608 INFO L226 Difference]: Without dead ends: 286727 [2024-11-19 17:15:53,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:53,654 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:53,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:15:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286727 states. [2024-11-19 17:15:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286727 to 262149. [2024-11-19 17:15:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262149 states, 262148 states have (on average 1.2499923707218823) internal successors, (327683), 262148 states have internal predecessors, (327683), 0 states have call successors, (0), 0 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-19 17:15:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262149 states to 262149 states and 327683 transitions. [2024-11-19 17:15:57,998 INFO L78 Accepts]: Start accepts. Automaton has 262149 states and 327683 transitions. Word has length 34 [2024-11-19 17:15:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:57,999 INFO L471 AbstractCegarLoop]: Abstraction has 262149 states and 327683 transitions. [2024-11-19 17:15:57,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 262149 states and 327683 transitions. [2024-11-19 17:15:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 17:15:58,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:58,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:15:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 17:15:58,146 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:58,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash 160018041, now seen corresponding path program 1 times [2024-11-19 17:15:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:58,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298382603] [2024-11-19 17:15:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:58,173 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-19 17:15:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298382603] [2024-11-19 17:15:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298382603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542369175] [2024-11-19 17:15:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:58,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:58,175 INFO L87 Difference]: Start difference. First operand 262149 states and 327683 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)