./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_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:12:13,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:12:13,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:12:13,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:12:13,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:12:13,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:12:13,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:12:13,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:12:13,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:12:13,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:12:13,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:12:13,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:12:13,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:12:13,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:12:13,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:12:13,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:12:13,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:12:13,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:12:13,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:12:13,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:12:13,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:12:13,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:12:13,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:12:13,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:12:13,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:12:13,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:12:13,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:12:13,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:12:13,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:12:13,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:12:13,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:12:13,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:12:13,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:13,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:12:13,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:12:13,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:12:13,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:12:13,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:12:13,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:12:13,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:12:13,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:12:13,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:12:13,917 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-10-12 15:12:14,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:12:14,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:12:14,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:12:14,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:12:14,126 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:12:14,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2024-10-12 15:12:15,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:12:15,629 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:12:15,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2024-10-12 15:12:15,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9644b10a0/4ed346949d1242929e132ff295022bff/FLAG10a23f897 [2024-10-12 15:12:16,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9644b10a0/4ed346949d1242929e132ff295022bff [2024-10-12 15:12:16,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:12:16,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:12:16,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:16,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:12:16,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:12:16,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6875e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16, skipping insertion in model container [2024-10-12 15:12:16,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:12:16,185 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2024-10-12 15:12:16,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:16,197 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:12:16,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2024-10-12 15:12:16,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:12:16,241 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:12:16,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16 WrapperNode [2024-10-12 15:12:16,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:12:16,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:16,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:12:16,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:12:16,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,269 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2024-10-12 15:12:16,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:12:16,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:12:16,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:12:16,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:12:16,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,325 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:12:16,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:12:16,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:12:16,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:12:16,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:12:16,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (1/1) ... [2024-10-12 15:12:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:12:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:12:16,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:12:16,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:12:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:12:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:12:16,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:12:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:12:16,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:12:16,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:12:16,643 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-12 15:12:16,643 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:12:16,673 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:12:16,673 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:12:16,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:16 BoogieIcfgContainer [2024-10-12 15:12:16,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:12:16,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:12:16,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:12:16,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:12:16,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:12:16" (1/3) ... [2024-10-12 15:12:16,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad656e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:16, skipping insertion in model container [2024-10-12 15:12:16,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:12:16" (2/3) ... [2024-10-12 15:12:16,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad656e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:12:16, skipping insertion in model container [2024-10-12 15:12:16,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:12:16" (3/3) ... [2024-10-12 15:12:16,680 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2024-10-12 15:12:16,694 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:12:16,694 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:12:16,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:12:16,759 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;@25279712, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:12:16,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:12:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 46 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:12:16,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:16,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:16,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:16,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash -111224238, now seen corresponding path program 1 times [2024-10-12 15:12:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071838871] [2024-10-12 15:12:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071838871] [2024-10-12 15:12:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071838871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404931105] [2024-10-12 15:12:16,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:16,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,004 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 46 states have internal predecessors, (88), 0 states have call successors, (0), 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 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,051 INFO L93 Difference]: Finished difference Result 96 states and 177 transitions. [2024-10-12 15:12:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 15:12:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,068 INFO L225 Difference]: With dead ends: 96 [2024-10-12 15:12:17,068 INFO L226 Difference]: Without dead ends: 86 [2024-10-12 15:12:17,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,073 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 65 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-12 15:12:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2024-10-12 15:12:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.912280701754386) internal successors, (109), 57 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2024-10-12 15:12:17,101 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2024-10-12 15:12:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,102 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2024-10-12 15:12:17,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2024-10-12 15:12:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:12:17,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:17,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:12:17,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1132292592, now seen corresponding path program 1 times [2024-10-12 15:12:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476732650] [2024-10-12 15:12:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476732650] [2024-10-12 15:12:17,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476732650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023497772] [2024-10-12 15:12:17,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,159 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,178 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2024-10-12 15:12:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 15:12:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,180 INFO L225 Difference]: With dead ends: 143 [2024-10-12 15:12:17,180 INFO L226 Difference]: Without dead ends: 86 [2024-10-12 15:12:17,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,181 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-12 15:12:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-10-12 15:12:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.891566265060241) internal successors, (157), 83 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2024-10-12 15:12:17,188 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2024-10-12 15:12:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,189 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2024-10-12 15:12:17,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2024-10-12 15:12:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:12:17,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,190 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] [2024-10-12 15:12:17,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:12:17,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash 847228294, now seen corresponding path program 1 times [2024-10-12 15:12:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062164989] [2024-10-12 15:12:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062164989] [2024-10-12 15:12:17,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062164989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141851991] [2024-10-12 15:12:17,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,243 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,258 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2024-10-12 15:12:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 15:12:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,259 INFO L225 Difference]: With dead ends: 131 [2024-10-12 15:12:17,259 INFO L226 Difference]: Without dead ends: 89 [2024-10-12 15:12:17,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,261 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-12 15:12:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-12 15:12:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.8488372093023255) internal successors, (159), 86 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2024-10-12 15:12:17,268 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2024-10-12 15:12:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,268 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2024-10-12 15:12:17,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2024-10-12 15:12:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:12:17,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,269 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] [2024-10-12 15:12:17,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:12:17,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -741119608, now seen corresponding path program 1 times [2024-10-12 15:12:17,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265162596] [2024-10-12 15:12:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265162596] [2024-10-12 15:12:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265162596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789258181] [2024-10-12 15:12:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,310 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,332 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2024-10-12 15:12:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 15:12:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,334 INFO L225 Difference]: With dead ends: 168 [2024-10-12 15:12:17,334 INFO L226 Difference]: Without dead ends: 166 [2024-10-12 15:12:17,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,335 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-12 15:12:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2024-10-12 15:12:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.8434782608695652) internal successors, (212), 115 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2024-10-12 15:12:17,349 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2024-10-12 15:12:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,350 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2024-10-12 15:12:17,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2024-10-12 15:12:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:12:17,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,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] [2024-10-12 15:12:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:12:17,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1762187962, now seen corresponding path program 1 times [2024-10-12 15:12:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557249132] [2024-10-12 15:12:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557249132] [2024-10-12 15:12:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557249132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066795319] [2024-10-12 15:12:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,423 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,486 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2024-10-12 15:12:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 15:12:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,487 INFO L225 Difference]: With dead ends: 280 [2024-10-12 15:12:17,487 INFO L226 Difference]: Without dead ends: 168 [2024-10-12 15:12:17,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,488 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 62 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:12:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-12 15:12:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2024-10-12 15:12:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.8303030303030303) internal successors, (302), 165 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2024-10-12 15:12:17,503 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2024-10-12 15:12:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,503 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2024-10-12 15:12:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2024-10-12 15:12:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:17,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,508 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] [2024-10-12 15:12:17,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:12:17,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1499658651, now seen corresponding path program 1 times [2024-10-12 15:12:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698755656] [2024-10-12 15:12:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698755656] [2024-10-12 15:12:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698755656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571981747] [2024-10-12 15:12:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,558 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,573 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2024-10-12 15:12:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-12 15:12:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,574 INFO L225 Difference]: With dead ends: 251 [2024-10-12 15:12:17,574 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 15:12:17,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,575 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 15:12:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2024-10-12 15:12:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.8083832335329342) internal successors, (302), 167 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2024-10-12 15:12:17,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2024-10-12 15:12:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,582 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2024-10-12 15:12:17,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2024-10-12 15:12:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:17,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,583 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] [2024-10-12 15:12:17,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:12:17,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1206960743, now seen corresponding path program 1 times [2024-10-12 15:12:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872075350] [2024-10-12 15:12:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872075350] [2024-10-12 15:12:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872075350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848536290] [2024-10-12 15:12:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,608 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,622 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2024-10-12 15:12:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-12 15:12:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,623 INFO L225 Difference]: With dead ends: 488 [2024-10-12 15:12:17,624 INFO L226 Difference]: Without dead ends: 326 [2024-10-12 15:12:17,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,625 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 62 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-12 15:12:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-12 15:12:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.7894736842105263) internal successors, (578), 323 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2024-10-12 15:12:17,639 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2024-10-12 15:12:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,639 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2024-10-12 15:12:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2024-10-12 15:12:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:12:17,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,640 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] [2024-10-12 15:12:17,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:12:17,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2066938199, now seen corresponding path program 1 times [2024-10-12 15:12:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420071543] [2024-10-12 15:12:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420071543] [2024-10-12 15:12:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420071543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246979690] [2024-10-12 15:12:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,666 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,677 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2024-10-12 15:12:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-12 15:12:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,679 INFO L225 Difference]: With dead ends: 416 [2024-10-12 15:12:17,679 INFO L226 Difference]: Without dead ends: 414 [2024-10-12 15:12:17,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,680 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 221 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-10-12 15:12:17,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-12 15:12:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2024-10-12 15:12:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.7770897832817338) internal successors, (574), 323 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2024-10-12 15:12:17,689 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2024-10-12 15:12:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,689 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2024-10-12 15:12:17,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2024-10-12 15:12:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:12:17,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,690 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-10-12 15:12:17,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:12:17,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1238709573, now seen corresponding path program 1 times [2024-10-12 15:12:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748131033] [2024-10-12 15:12:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,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-10-12 15:12:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748131033] [2024-10-12 15:12:17,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748131033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016337148] [2024-10-12 15:12:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,712 INFO L87 Difference]: Start difference. First operand 324 states and 574 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-10-12 15:12:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,725 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2024-10-12 15:12:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,725 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-10-12 15:12:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,727 INFO L225 Difference]: With dead ends: 612 [2024-10-12 15:12:17,727 INFO L226 Difference]: Without dead ends: 610 [2024-10-12 15:12:17,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,728 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-12 15:12:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2024-10-12 15:12:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.749440715883669) internal successors, (782), 447 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2024-10-12 15:12:17,737 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2024-10-12 15:12:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,737 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2024-10-12 15:12:17,737 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-10-12 15:12:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2024-10-12 15:12:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:12:17,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,739 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-10-12 15:12:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:12:17,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2035189369, now seen corresponding path program 1 times [2024-10-12 15:12:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867501583] [2024-10-12 15:12:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867501583] [2024-10-12 15:12:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867501583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163090563] [2024-10-12 15:12:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,760 INFO L87 Difference]: Start difference. First operand 448 states and 782 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-10-12 15:12:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,778 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2024-10-12 15:12:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,778 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-10-12 15:12:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,780 INFO L225 Difference]: With dead ends: 1076 [2024-10-12 15:12:17,780 INFO L226 Difference]: Without dead ends: 634 [2024-10-12 15:12:17,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,781 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-12 15:12:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2024-10-12 15:12:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.740095087163233) internal successors, (1098), 631 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2024-10-12 15:12:17,798 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2024-10-12 15:12:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,798 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2024-10-12 15:12:17,798 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-10-12 15:12:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2024-10-12 15:12:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:17,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,800 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-10-12 15:12:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:12:17,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash 254922300, now seen corresponding path program 1 times [2024-10-12 15:12:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290574596] [2024-10-12 15:12:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290574596] [2024-10-12 15:12:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290574596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160393386] [2024-10-12 15:12:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,838 INFO L87 Difference]: Start difference. First operand 632 states and 1098 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-10-12 15:12:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,858 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2024-10-12 15:12:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,859 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-10-12 15:12:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,861 INFO L225 Difference]: With dead ends: 956 [2024-10-12 15:12:17,861 INFO L226 Difference]: Without dead ends: 646 [2024-10-12 15:12:17,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,863 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 62 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-12 15:12:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2024-10-12 15:12:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.7200622083981338) internal successors, (1106), 643 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2024-10-12 15:12:17,877 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2024-10-12 15:12:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,877 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2024-10-12 15:12:17,877 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-10-12 15:12:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2024-10-12 15:12:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:17,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,878 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-10-12 15:12:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:12:17,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1333425602, now seen corresponding path program 1 times [2024-10-12 15:12:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803973915] [2024-10-12 15:12:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,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-10-12 15:12:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803973915] [2024-10-12 15:12:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803973915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903664622] [2024-10-12 15:12:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,910 INFO L87 Difference]: Start difference. First operand 644 states and 1106 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-10-12 15:12:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:17,931 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2024-10-12 15:12:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:17,932 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-10-12 15:12:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:17,935 INFO L225 Difference]: With dead ends: 1192 [2024-10-12 15:12:17,937 INFO L226 Difference]: Without dead ends: 1190 [2024-10-12 15:12:17,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,938 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 51 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:17,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-12 15:12:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2024-10-12 15:12:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.6840934371523915) internal successors, (1514), 899 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2024-10-12 15:12:17,958 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2024-10-12 15:12:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:17,958 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2024-10-12 15:12:17,959 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-10-12 15:12:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2024-10-12 15:12:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:12:17,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:17,962 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-10-12 15:12:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:12:17,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1940473340, now seen corresponding path program 1 times [2024-10-12 15:12:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130452784] [2024-10-12 15:12:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:17,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130452784] [2024-10-12 15:12:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130452784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063617884] [2024-10-12 15:12:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:17,998 INFO L87 Difference]: Start difference. First operand 900 states and 1514 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-10-12 15:12:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,019 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2024-10-12 15:12:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,020 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-10-12 15:12:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,023 INFO L225 Difference]: With dead ends: 2136 [2024-10-12 15:12:18,023 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:12:18,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,024 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 186 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:12:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2024-10-12 15:12:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.6770583533173462) internal successors, (2098), 1251 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2024-10-12 15:12:18,045 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2024-10-12 15:12:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,045 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2024-10-12 15:12:18,045 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-10-12 15:12:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2024-10-12 15:12:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:18,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,046 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-10-12 15:12:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:12:18,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1613693038, now seen corresponding path program 1 times [2024-10-12 15:12:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205744422] [2024-10-12 15:12:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205744422] [2024-10-12 15:12:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205744422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020968630] [2024-10-12 15:12:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,064 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 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-10-12 15:12:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,085 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2024-10-12 15:12:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,085 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-10-12 15:12:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,088 INFO L225 Difference]: With dead ends: 1880 [2024-10-12 15:12:18,088 INFO L226 Difference]: Without dead ends: 1270 [2024-10-12 15:12:18,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,089 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-12 15:12:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2024-10-12 15:12:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.6558800315706392) internal successors, (2098), 1267 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2024-10-12 15:12:18,111 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2024-10-12 15:12:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,111 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2024-10-12 15:12:18,111 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-10-12 15:12:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2024-10-12 15:12:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:18,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,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] [2024-10-12 15:12:18,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:12:18,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash 25345136, now seen corresponding path program 1 times [2024-10-12 15:12:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708752967] [2024-10-12 15:12:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708752967] [2024-10-12 15:12:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708752967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442462204] [2024-10-12 15:12:18,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,131 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 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-10-12 15:12:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,158 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2024-10-12 15:12:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,159 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-10-12 15:12:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,165 INFO L225 Difference]: With dead ends: 2312 [2024-10-12 15:12:18,165 INFO L226 Difference]: Without dead ends: 2310 [2024-10-12 15:12:18,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,166 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 48 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2024-10-12 15:12:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2024-10-12 15:12:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1795 states have (on average 1.6144846796657382) internal successors, (2898), 1795 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2024-10-12 15:12:18,200 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2024-10-12 15:12:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,201 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2024-10-12 15:12:18,201 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-10-12 15:12:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2024-10-12 15:12:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:12:18,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:12:18,203 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -995723218, now seen corresponding path program 1 times [2024-10-12 15:12:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393187738] [2024-10-12 15:12:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393187738] [2024-10-12 15:12:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393187738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291253694] [2024-10-12 15:12:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,222 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 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-10-12 15:12:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,256 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2024-10-12 15:12:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,257 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-10-12 15:12:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,262 INFO L225 Difference]: With dead ends: 4232 [2024-10-12 15:12:18,262 INFO L226 Difference]: Without dead ends: 2470 [2024-10-12 15:12:18,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,264 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 187 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2024-10-12 15:12:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2024-10-12 15:12:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.6092419943250913) internal successors, (3970), 2467 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2024-10-12 15:12:18,327 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2024-10-12 15:12:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,327 INFO L471 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2024-10-12 15:12:18,327 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-10-12 15:12:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2024-10-12 15:12:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:18,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,329 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-10-12 15:12:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:12:18,329 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,329 INFO L85 PathProgramCache]: Analyzing trace with hash 785913297, now seen corresponding path program 1 times [2024-10-12 15:12:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990450590] [2024-10-12 15:12:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990450590] [2024-10-12 15:12:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990450590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438299912] [2024-10-12 15:12:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,347 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 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-10-12 15:12:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,391 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2024-10-12 15:12:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,392 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-10-12 15:12:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,398 INFO L225 Difference]: With dead ends: 3704 [2024-10-12 15:12:18,398 INFO L226 Difference]: Without dead ends: 2502 [2024-10-12 15:12:18,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,400 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2024-10-12 15:12:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2024-10-12 15:12:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.5886354541816727) internal successors, (3970), 2499 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2024-10-12 15:12:18,463 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2024-10-12 15:12:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2024-10-12 15:12:18,464 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-10-12 15:12:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2024-10-12 15:12:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:18,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,466 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-10-12 15:12:18,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 15:12:18,466 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -802434605, now seen corresponding path program 1 times [2024-10-12 15:12:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778023656] [2024-10-12 15:12:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778023656] [2024-10-12 15:12:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778023656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471547863] [2024-10-12 15:12:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,490 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 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-10-12 15:12:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,547 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2024-10-12 15:12:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,548 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-10-12 15:12:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,559 INFO L225 Difference]: With dead ends: 4488 [2024-10-12 15:12:18,559 INFO L226 Difference]: Without dead ends: 4486 [2024-10-12 15:12:18,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,561 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2024-10-12 15:12:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2024-10-12 15:12:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 3587 states have (on average 1.5439085586841372) internal successors, (5538), 3587 states have internal predecessors, (5538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2024-10-12 15:12:18,665 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2024-10-12 15:12:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2024-10-12 15:12:18,665 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-10-12 15:12:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2024-10-12 15:12:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:12:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12: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, 1, 1] [2024-10-12 15:12:18,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:12:18,669 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1823502959, now seen corresponding path program 1 times [2024-10-12 15:12:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606434798] [2024-10-12 15:12:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606434798] [2024-10-12 15:12:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606434798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002001477] [2024-10-12 15:12:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,689 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 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-10-12 15:12:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:18,752 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2024-10-12 15:12:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:18,753 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-10-12 15:12:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:18,764 INFO L225 Difference]: With dead ends: 8392 [2024-10-12 15:12:18,764 INFO L226 Difference]: Without dead ends: 4870 [2024-10-12 15:12:18,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,769 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:18,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 188 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2024-10-12 15:12:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2024-10-12 15:12:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5389356893363468) internal successors, (7490), 4867 states have internal predecessors, (7490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2024-10-12 15:12:18,865 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2024-10-12 15:12:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:18,865 INFO L471 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2024-10-12 15:12:18,865 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-10-12 15:12:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2024-10-12 15:12:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:18,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:18,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:18,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 15:12:18,869 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 894545443, now seen corresponding path program 1 times [2024-10-12 15:12:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984064470] [2024-10-12 15:12:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984064470] [2024-10-12 15:12:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984064470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342870354] [2024-10-12 15:12:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:18,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:18,886 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 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-10-12 15:12:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:19,002 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2024-10-12 15:12:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:19,002 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-10-12 15:12:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:19,012 INFO L225 Difference]: With dead ends: 7304 [2024-10-12 15:12:19,012 INFO L226 Difference]: Without dead ends: 4934 [2024-10-12 15:12:19,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,015 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:19,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2024-10-12 15:12:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2024-10-12 15:12:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4932 states, 4931 states have (on average 1.5189616710606368) internal successors, (7490), 4931 states have internal predecessors, (7490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2024-10-12 15:12:19,111 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2024-10-12 15:12:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:19,111 INFO L471 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2024-10-12 15:12:19,112 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-10-12 15:12:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2024-10-12 15:12:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:19,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:19,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:12:19,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -693802459, now seen corresponding path program 1 times [2024-10-12 15:12:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318707853] [2024-10-12 15:12:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12: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-10-12 15:12:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318707853] [2024-10-12 15:12:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318707853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:19,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:19,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496097788] [2024-10-12 15:12:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:19,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,139 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 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-10-12 15:12:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:19,289 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2024-10-12 15:12:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:19,290 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-10-12 15:12:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:19,308 INFO L225 Difference]: With dead ends: 8712 [2024-10-12 15:12:19,308 INFO L226 Difference]: Without dead ends: 8710 [2024-10-12 15:12:19,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,311 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:19,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2024-10-12 15:12:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2024-10-12 15:12:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7171 states have (on average 1.4728768651513038) internal successors, (10562), 7171 states have internal predecessors, (10562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2024-10-12 15:12:19,436 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2024-10-12 15:12:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2024-10-12 15:12:19,437 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-10-12 15:12:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2024-10-12 15:12:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 15:12:19,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:19,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:19,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 15:12:19,443 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:19,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1714870813, now seen corresponding path program 1 times [2024-10-12 15:12:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:19,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304408667] [2024-10-12 15:12:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:19,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304408667] [2024-10-12 15:12:19,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304408667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:19,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:19,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535093219] [2024-10-12 15:12:19,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:19,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,459 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 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-10-12 15:12:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:19,601 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2024-10-12 15:12:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:19,603 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-10-12 15:12:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:19,616 INFO L225 Difference]: With dead ends: 16648 [2024-10-12 15:12:19,616 INFO L226 Difference]: Without dead ends: 9606 [2024-10-12 15:12:19,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,623 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:19,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 189 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2024-10-12 15:12:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2024-10-12 15:12:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9604 states, 9603 states have (on average 1.4664167447672602) internal successors, (14082), 9603 states have internal predecessors, (14082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2024-10-12 15:12:19,852 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2024-10-12 15:12:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2024-10-12 15:12:19,853 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-10-12 15:12:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2024-10-12 15:12:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:19,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:19,861 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-10-12 15:12:19,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:12:19,861 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash -32824986, now seen corresponding path program 1 times [2024-10-12 15:12:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054202478] [2024-10-12 15:12:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:19,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054202478] [2024-10-12 15:12:19,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054202478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:19,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:19,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812751195] [2024-10-12 15:12:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:19,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:19,887 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 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-10-12 15:12:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:20,054 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2024-10-12 15:12:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:20,054 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-10-12 15:12:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:20,069 INFO L225 Difference]: With dead ends: 14408 [2024-10-12 15:12:20,069 INFO L226 Difference]: Without dead ends: 9734 [2024-10-12 15:12:20,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,077 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2024-10-12 15:12:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2024-10-12 15:12:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9732 states, 9731 states have (on average 1.44712773610112) internal successors, (14082), 9731 states have internal predecessors, (14082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2024-10-12 15:12:20,273 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2024-10-12 15:12:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:20,273 INFO L471 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2024-10-12 15:12:20,273 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-10-12 15:12:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2024-10-12 15:12:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:20,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:20,279 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-10-12 15:12:20,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:12:20,279 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1621172888, now seen corresponding path program 1 times [2024-10-12 15:12:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537134937] [2024-10-12 15:12:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537134937] [2024-10-12 15:12:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537134937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685420529] [2024-10-12 15:12:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,302 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 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-10-12 15:12:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:20,419 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2024-10-12 15:12:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:20,419 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-10-12 15:12:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:20,446 INFO L225 Difference]: With dead ends: 16904 [2024-10-12 15:12:20,447 INFO L226 Difference]: Without dead ends: 16902 [2024-10-12 15:12:20,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,455 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:20,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2024-10-12 15:12:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2024-10-12 15:12:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14340 states, 14339 states have (on average 1.401631912964642) internal successors, (20098), 14339 states have internal predecessors, (20098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2024-10-12 15:12:20,708 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2024-10-12 15:12:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2024-10-12 15:12:20,708 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-10-12 15:12:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2024-10-12 15:12:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:12:20,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:20,720 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-10-12 15:12:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 15:12:20,720 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1652726054, now seen corresponding path program 1 times [2024-10-12 15:12:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078793920] [2024-10-12 15:12:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078793920] [2024-10-12 15:12:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078793920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219202359] [2024-10-12 15:12:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,737 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 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-10-12 15:12:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:20,936 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2024-10-12 15:12:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:20,936 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-10-12 15:12:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:20,963 INFO L225 Difference]: With dead ends: 33032 [2024-10-12 15:12:20,963 INFO L226 Difference]: Without dead ends: 18950 [2024-10-12 15:12:20,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:20,976 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:20,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 190 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2024-10-12 15:12:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2024-10-12 15:12:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18948 states, 18947 states have (on average 1.3917770623317676) internal successors, (26370), 18947 states have internal predecessors, (26370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2024-10-12 15:12:21,405 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2024-10-12 15:12:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:21,405 INFO L471 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2024-10-12 15:12:21,405 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-10-12 15:12:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2024-10-12 15:12:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:12:21,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:21,419 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-10-12 15:12:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 15:12:21,420 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1283463128, now seen corresponding path program 1 times [2024-10-12 15:12:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099816727] [2024-10-12 15:12:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099816727] [2024-10-12 15:12:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099816727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:21,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238756367] [2024-10-12 15:12:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:21,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:21,448 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 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-10-12 15:12:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:21,743 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2024-10-12 15:12:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:21,745 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-10-12 15:12:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:21,770 INFO L225 Difference]: With dead ends: 28424 [2024-10-12 15:12:21,770 INFO L226 Difference]: Without dead ends: 19206 [2024-10-12 15:12:21,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:21,779 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:21,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2024-10-12 15:12:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2024-10-12 15:12:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19204 states, 19203 states have (on average 1.3732229339165756) internal successors, (26370), 19203 states have internal predecessors, (26370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2024-10-12 15:12:22,030 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2024-10-12 15:12:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:22,030 INFO L471 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2024-10-12 15:12:22,030 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-10-12 15:12:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2024-10-12 15:12:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:12:22,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:22,041 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-10-12 15:12:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 15:12:22,041 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -304884774, now seen corresponding path program 1 times [2024-10-12 15:12:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654990014] [2024-10-12 15:12:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:22,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654990014] [2024-10-12 15:12:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654990014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:22,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:22,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828817863] [2024-10-12 15:12:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:22,065 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 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-10-12 15:12:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:22,357 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2024-10-12 15:12:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:22,357 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-10-12 15:12:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:22,390 INFO L225 Difference]: With dead ends: 32776 [2024-10-12 15:12:22,390 INFO L226 Difference]: Without dead ends: 32774 [2024-10-12 15:12:22,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:22,396 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:22,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2024-10-12 15:12:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2024-10-12 15:12:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28676 states, 28675 states have (on average 1.3302877070619006) internal successors, (38146), 28675 states have internal predecessors, (38146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2024-10-12 15:12:22,845 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2024-10-12 15:12:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:22,845 INFO L471 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2024-10-12 15:12:22,845 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-10-12 15:12:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2024-10-12 15:12:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:12:22,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:22,862 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-10-12 15:12:22,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 15:12:22,863 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:22,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1325953128, now seen corresponding path program 1 times [2024-10-12 15:12:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:22,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6416495] [2024-10-12 15:12:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6416495] [2024-10-12 15:12:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6416495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:22,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589613774] [2024-10-12 15:12:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:22,886 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 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-10-12 15:12:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:23,365 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2024-10-12 15:12:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:23,366 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-10-12 15:12:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:23,407 INFO L225 Difference]: With dead ends: 65544 [2024-10-12 15:12:23,407 INFO L226 Difference]: Without dead ends: 37382 [2024-10-12 15:12:23,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:23,431 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:23,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2024-10-12 15:12:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2024-10-12 15:12:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37380 states, 37379 states have (on average 1.3150164530886326) internal successors, (49154), 37379 states have internal predecessors, (49154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2024-10-12 15:12:24,224 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2024-10-12 15:12:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:24,225 INFO L471 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2024-10-12 15:12:24,225 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-10-12 15:12:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2024-10-12 15:12:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:12:24,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:24,239 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-10-12 15:12:24,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 15:12:24,239 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:24,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash -861277957, now seen corresponding path program 1 times [2024-10-12 15:12:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:24,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403152069] [2024-10-12 15:12:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403152069] [2024-10-12 15:12:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403152069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090759889] [2024-10-12 15:12:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:24,253 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 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-10-12 15:12:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:24,691 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2024-10-12 15:12:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:24,692 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-10-12 15:12:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:24,732 INFO L225 Difference]: With dead ends: 56072 [2024-10-12 15:12:24,732 INFO L226 Difference]: Without dead ends: 37894 [2024-10-12 15:12:24,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:24,746 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:24,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2024-10-12 15:12:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2024-10-12 15:12:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37892 states, 37891 states have (on average 1.2972473674487346) internal successors, (49154), 37891 states have internal predecessors, (49154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2024-10-12 15:12:25,457 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2024-10-12 15:12:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:25,457 INFO L471 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2024-10-12 15:12:25,457 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-10-12 15:12:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2024-10-12 15:12:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:12:25,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:25,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, 1, 1] [2024-10-12 15:12:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 15:12:25,470 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1845341437, now seen corresponding path program 1 times [2024-10-12 15:12:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382089363] [2024-10-12 15:12:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382089363] [2024-10-12 15:12:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382089363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285246341] [2024-10-12 15:12:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:25,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:25,485 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 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-10-12 15:12:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:26,274 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2024-10-12 15:12:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:26,274 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-10-12 15:12:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:26,354 INFO L225 Difference]: With dead ends: 110600 [2024-10-12 15:12:26,354 INFO L226 Difference]: Without dead ends: 73734 [2024-10-12 15:12:26,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:26,384 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:26,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 160 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2024-10-12 15:12:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2024-10-12 15:12:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73732 states, 73731 states have (on average 1.2499762650716795) internal successors, (92162), 73731 states have internal predecessors, (92162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2024-10-12 15:12:27,863 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2024-10-12 15:12:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:27,863 INFO L471 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2024-10-12 15:12:27,863 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-10-12 15:12:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2024-10-12 15:12:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:12:27,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:27,899 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-10-12 15:12:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 15:12:27,899 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1428557505, now seen corresponding path program 1 times [2024-10-12 15:12:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274088127] [2024-10-12 15:12:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274088127] [2024-10-12 15:12:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274088127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435913500] [2024-10-12 15:12:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:27,914 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 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-10-12 15:12:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:29,107 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2024-10-12 15:12:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:29,107 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-10-12 15:12:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:29,201 INFO L225 Difference]: With dead ends: 79880 [2024-10-12 15:12:29,201 INFO L226 Difference]: Without dead ends: 79878 [2024-10-12 15:12:29,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:29,217 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 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-10-12 15:12:29,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2024-10-12 15:12:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2024-10-12 15:12:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73732 states, 73731 states have (on average 1.2360879413001316) internal successors, (91138), 73731 states have internal predecessors, (91138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2024-10-12 15:12:30,743 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2024-10-12 15:12:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:30,744 INFO L471 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2024-10-12 15:12:30,744 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-10-12 15:12:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2024-10-12 15:12:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 15:12:30,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:30,777 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-10-12 15:12:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 15:12:30,777 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1371225485, now seen corresponding path program 1 times [2024-10-12 15:12:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373762448] [2024-10-12 15:12:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373762448] [2024-10-12 15:12:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373762448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:30,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440263923] [2024-10-12 15:12:30,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:30,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:30,791 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 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-10-12 15:12:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:32,252 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2024-10-12 15:12:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:32,252 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-10-12 15:12:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:32,370 INFO L225 Difference]: With dead ends: 121864 [2024-10-12 15:12:32,370 INFO L226 Difference]: Without dead ends: 121862 [2024-10-12 15:12:32,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:32,386 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 30 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:32,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2024-10-12 15:12:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2024-10-12 15:12:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113668 states, 113667 states have (on average 1.207192940783165) internal successors, (137218), 113667 states have internal predecessors, (137218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2024-10-12 15:12:34,312 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2024-10-12 15:12:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:34,313 INFO L471 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2024-10-12 15:12:34,313 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-10-12 15:12:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2024-10-12 15:12:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 15:12:34,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:34,415 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-10-12 15:12:34,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 15:12:34,415 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:34,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 350157131, now seen corresponding path program 1 times [2024-10-12 15:12:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:34,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479812458] [2024-10-12 15:12:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479812458] [2024-10-12 15:12:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479812458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077649701] [2024-10-12 15:12:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:34,450 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 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-10-12 15:12:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:36,428 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2024-10-12 15:12:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:36,429 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-10-12 15:12:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:36,629 INFO L225 Difference]: With dead ends: 257032 [2024-10-12 15:12:36,629 INFO L226 Difference]: Without dead ends: 144390 [2024-10-12 15:12:36,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:36,703 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:36,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 193 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2024-10-12 15:12:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2024-10-12 15:12:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144388 states, 144387 states have (on average 1.1772943547549295) internal successors, (169986), 144387 states have internal predecessors, (169986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2024-10-12 15:12:39,884 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2024-10-12 15:12:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:39,884 INFO L471 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2024-10-12 15:12:39,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-10-12 15:12:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2024-10-12 15:12:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 15:12:39,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:39,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 15:12:39,946 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -441466798, now seen corresponding path program 1 times [2024-10-12 15:12:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813754812] [2024-10-12 15:12:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813754812] [2024-10-12 15:12:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813754812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976131234] [2024-10-12 15:12:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:39,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:39,960 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 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-10-12 15:12:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:42,084 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2024-10-12 15:12:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:42,084 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-10-12 15:12:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:42,256 INFO L225 Difference]: With dead ends: 218120 [2024-10-12 15:12:42,256 INFO L226 Difference]: Without dead ends: 147462 [2024-10-12 15:12:42,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:42,321 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:42,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2024-10-12 15:12:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2024-10-12 15:12:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147460 states, 147459 states have (on average 1.1666564943475815) internal successors, (172034), 147459 states have internal predecessors, (172034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:12:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2024-10-12 15:12:45,397 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2024-10-12 15:12:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:12:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2024-10-12 15:12:45,398 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-10-12 15:12:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2024-10-12 15:12:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 15:12:45,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:12:45,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:12:45,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 15:12:45,468 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:12:45,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:12:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2029814700, now seen corresponding path program 1 times [2024-10-12 15:12:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:12:45,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820918237] [2024-10-12 15:12:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:12:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:12:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:12:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:12:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:12:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820918237] [2024-10-12 15:12:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820918237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:12:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:12:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:12:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782337826] [2024-10-12 15:12:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:12:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:12:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:12:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:12:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:45,483 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 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-10-12 15:12:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:12:48,292 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2024-10-12 15:12:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:12:48,293 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-10-12 15:12:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:12:48,593 INFO L225 Difference]: With dead ends: 237574 [2024-10-12 15:12:48,593 INFO L226 Difference]: Without dead ends: 237572 [2024-10-12 15:12:48,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:12:48,637 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 26 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:12:48,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:12:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states.