./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:23:27,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:23:27,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:23:27,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:23:27,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:23:27,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:23:27,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:23:27,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:23:27,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:23:27,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:23:27,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:23:27,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:23:27,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:23:27,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:23:27,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:23:27,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:23:27,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:23:27,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:23:28,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:23:28,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:23:28,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:23:28,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:23:28,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:23:28,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:23:28,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:23:28,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:23:28,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:23:28,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:23:28,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:23:28,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:23:28,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:23:28,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:23:28,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:28,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:23:28,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:23:28,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:23:28,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:23:28,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:23:28,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:23:28,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:23:28,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:23:28,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:23:28,012 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2024-11-08 10:23:28,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:23:28,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:23:28,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:23:28,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:23:28,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:23:28,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2024-11-08 10:23:29,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:23:29,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:23:29,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2024-11-08 10:23:29,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d6cb19b/41ba227255db43a8b0b2348150be77c1/FLAG4a7b1ea70 [2024-11-08 10:23:29,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d6cb19b/41ba227255db43a8b0b2348150be77c1 [2024-11-08 10:23:29,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:23:29,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:23:29,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:29,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:23:29,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:23:29,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:29" (1/1) ... [2024-11-08 10:23:29,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c25222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:29, skipping insertion in model container [2024-11-08 10:23:29,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:29" (1/1) ... [2024-11-08 10:23:29,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:23:30,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2024-11-08 10:23:30,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:30,075 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:23:30,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2024-11-08 10:23:30,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:30,137 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:23:30,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30 WrapperNode [2024-11-08 10:23:30,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:30,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:30,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:23:30,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:23:30,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,173 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 172 [2024-11-08 10:23:30,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:30,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:23:30,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:23:30,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:23:30,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,195 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:23:30,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:23:30,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:23:30,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:23:30,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:23:30,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (1/1) ... [2024-11-08 10:23:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:30,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:30,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:23:30,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:23:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:23:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:23:30,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:23:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:23:30,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:23:30,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:23:30,545 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-08 10:23:30,545 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:23:30,559 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:23:30,559 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:23:30,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:30 BoogieIcfgContainer [2024-11-08 10:23:30,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:23:30,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:23:30,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:23:30,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:23:30,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:23:29" (1/3) ... [2024-11-08 10:23:30,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9673d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:30, skipping insertion in model container [2024-11-08 10:23:30,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:30" (2/3) ... [2024-11-08 10:23:30,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9673d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:30, skipping insertion in model container [2024-11-08 10:23:30,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:30" (3/3) ... [2024-11-08 10:23:30,567 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2024-11-08 10:23:30,580 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:23:30,580 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:23:30,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:23:30,642 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;@282d64a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:23:30,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:23:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 10:23:30,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:30,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:30,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2024-11-08 10:23:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:30,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630885060] [2024-11-08 10:23:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630885060] [2024-11-08 10:23:30,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630885060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:30,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:30,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698586283] [2024-11-08 10:23:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:30,941 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-08 10:23:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,001 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2024-11-08 10:23:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,004 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-11-08 10:23:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,013 INFO L225 Difference]: With dead ends: 93 [2024-11-08 10:23:31,013 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 10:23:31,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,021 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 10:23:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2024-11-08 10:23:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2024-11-08 10:23:31,062 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2024-11-08 10:23:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,064 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2024-11-08 10:23:31,064 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-11-08 10:23:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2024-11-08 10:23:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 10:23:31,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,065 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-11-08 10:23:31,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:23:31,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2024-11-08 10:23:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124393720] [2024-11-08 10:23:31,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124393720] [2024-11-08 10:23:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124393720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344644900] [2024-11-08 10:23:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,175 INFO L87 Difference]: Start difference. First operand 55 states and 102 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-11-08 10:23:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,201 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2024-11-08 10:23:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,202 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-11-08 10:23:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,205 INFO L225 Difference]: With dead ends: 134 [2024-11-08 10:23:31,205 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 10:23:31,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,207 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 10:23:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-08 10:23:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2024-11-08 10:23:31,224 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2024-11-08 10:23:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,224 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2024-11-08 10:23:31,225 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-11-08 10:23:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2024-11-08 10:23:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 10:23:31,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,227 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-11-08 10:23:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:23:31,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2024-11-08 10:23:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128008755] [2024-11-08 10:23:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128008755] [2024-11-08 10:23:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128008755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537743348] [2024-11-08 10:23:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,315 INFO L87 Difference]: Start difference. First operand 79 states and 146 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-11-08 10:23:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,343 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2024-11-08 10:23:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,344 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-11-08 10:23:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,345 INFO L225 Difference]: With dead ends: 123 [2024-11-08 10:23:31,345 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 10:23:31,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,347 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 10:23:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-08 10:23:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2024-11-08 10:23:31,363 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2024-11-08 10:23:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,364 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2024-11-08 10:23:31,364 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-11-08 10:23:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2024-11-08 10:23:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 10:23:31,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,365 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-11-08 10:23:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:23:31,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2024-11-08 10:23:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014208870] [2024-11-08 10:23:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014208870] [2024-11-08 10:23:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014208870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581997640] [2024-11-08 10:23:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,428 INFO L87 Difference]: Start difference. First operand 82 states and 148 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-11-08 10:23:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,452 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2024-11-08 10:23:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,452 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-11-08 10:23:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,454 INFO L225 Difference]: With dead ends: 157 [2024-11-08 10:23:31,454 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 10:23:31,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-11-08 10:23:31,456 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 10:23:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2024-11-08 10:23:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2024-11-08 10:23:31,470 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2024-11-08 10:23:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2024-11-08 10:23:31,470 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-11-08 10:23:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2024-11-08 10:23:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 10:23:31,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,472 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-11-08 10:23:31,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:23:31,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2024-11-08 10:23:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454963291] [2024-11-08 10:23:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454963291] [2024-11-08 10:23:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454963291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160892636] [2024-11-08 10:23:31,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,532 INFO L87 Difference]: Start difference. First operand 109 states and 197 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-11-08 10:23:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,557 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2024-11-08 10:23:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,557 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-11-08 10:23:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,558 INFO L225 Difference]: With dead ends: 261 [2024-11-08 10:23:31,558 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 10:23:31,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,560 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 10:23:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-08 10:23:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2024-11-08 10:23:31,575 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2024-11-08 10:23:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2024-11-08 10:23:31,575 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-11-08 10:23:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2024-11-08 10:23:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 10:23:31,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,576 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-11-08 10:23:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:23:31,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2024-11-08 10:23:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117030066] [2024-11-08 10:23:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117030066] [2024-11-08 10:23:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117030066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056876450] [2024-11-08 10:23:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,659 INFO L87 Difference]: Start difference. First operand 155 states and 279 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-11-08 10:23:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,707 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2024-11-08 10:23:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,707 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-11-08 10:23:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,710 INFO L225 Difference]: With dead ends: 234 [2024-11-08 10:23:31,710 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 10:23:31,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,712 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 10:23:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-08 10:23:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2024-11-08 10:23:31,732 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2024-11-08 10:23:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,732 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2024-11-08 10:23:31,733 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-11-08 10:23:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2024-11-08 10:23:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 10:23:31,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,733 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-11-08 10:23:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:23:31,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2024-11-08 10:23:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595930497] [2024-11-08 10:23:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595930497] [2024-11-08 10:23:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595930497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30602001] [2024-11-08 10:23:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,770 INFO L87 Difference]: Start difference. First operand 157 states and 279 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-11-08 10:23:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,792 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2024-11-08 10:23:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,793 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-11-08 10:23:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,794 INFO L225 Difference]: With dead ends: 453 [2024-11-08 10:23:31,794 INFO L226 Difference]: Without dead ends: 303 [2024-11-08 10:23:31,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,798 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-08 10:23:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-08 10:23:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2024-11-08 10:23:31,822 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2024-11-08 10:23:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2024-11-08 10:23:31,822 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-11-08 10:23:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2024-11-08 10:23:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 10:23:31,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,823 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-11-08 10:23:31,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:23:31,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2024-11-08 10:23:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837073516] [2024-11-08 10:23:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837073516] [2024-11-08 10:23:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837073516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262726902] [2024-11-08 10:23:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,865 INFO L87 Difference]: Start difference. First operand 301 states and 531 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-11-08 10:23:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,882 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2024-11-08 10:23:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,882 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-11-08 10:23:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,884 INFO L225 Difference]: With dead ends: 385 [2024-11-08 10:23:31,884 INFO L226 Difference]: Without dead ends: 383 [2024-11-08 10:23:31,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,887 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-08 10:23:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2024-11-08 10:23:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2024-11-08 10:23:31,905 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2024-11-08 10:23:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:31,906 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2024-11-08 10:23:31,906 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-11-08 10:23:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2024-11-08 10:23:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 10:23:31,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:31,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:23:31,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2024-11-08 10:23:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826554851] [2024-11-08 10:23:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:31,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826554851] [2024-11-08 10:23:31,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826554851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:31,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:31,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374001580] [2024-11-08 10:23:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,957 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:31,977 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2024-11-08 10:23:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-08 10:23:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:31,982 INFO L225 Difference]: With dead ends: 565 [2024-11-08 10:23:31,983 INFO L226 Difference]: Without dead ends: 563 [2024-11-08 10:23:31,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:31,983 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:31,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-08 10:23:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2024-11-08 10:23:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2024-11-08 10:23:31,999 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2024-11-08 10:23:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,000 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2024-11-08 10:23:32,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2024-11-08 10:23:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 10:23:32,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:23:32,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2024-11-08 10:23:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327922825] [2024-11-08 10:23:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327922825] [2024-11-08 10:23:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327922825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226362017] [2024-11-08 10:23:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,041 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,063 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2024-11-08 10:23:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-08 10:23:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,066 INFO L225 Difference]: With dead ends: 997 [2024-11-08 10:23:32,066 INFO L226 Difference]: Without dead ends: 587 [2024-11-08 10:23:32,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,067 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-08 10:23:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2024-11-08 10:23:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2024-11-08 10:23:32,084 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2024-11-08 10:23:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,085 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2024-11-08 10:23:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2024-11-08 10:23:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:32,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:23:32,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2024-11-08 10:23:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425881979] [2024-11-08 10:23:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425881979] [2024-11-08 10:23:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425881979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330208494] [2024-11-08 10:23:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,123 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,142 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2024-11-08 10:23:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-08 10:23:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,145 INFO L225 Difference]: With dead ends: 885 [2024-11-08 10:23:32,145 INFO L226 Difference]: Without dead ends: 599 [2024-11-08 10:23:32,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,146 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-08 10:23:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2024-11-08 10:23:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2024-11-08 10:23:32,161 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2024-11-08 10:23:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2024-11-08 10:23:32,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2024-11-08 10:23:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:32,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:23:32,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2024-11-08 10:23:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805385764] [2024-11-08 10:23:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805385764] [2024-11-08 10:23:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805385764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12025174] [2024-11-08 10:23:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,194 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,230 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2024-11-08 10:23:32,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-08 10:23:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,235 INFO L225 Difference]: With dead ends: 1097 [2024-11-08 10:23:32,237 INFO L226 Difference]: Without dead ends: 1095 [2024-11-08 10:23:32,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,238 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-08 10:23:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2024-11-08 10:23:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2024-11-08 10:23:32,260 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2024-11-08 10:23:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2024-11-08 10:23:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2024-11-08 10:23:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:23:32,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:23:32,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2024-11-08 10:23:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239000869] [2024-11-08 10:23:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239000869] [2024-11-08 10:23:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239000869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066750887] [2024-11-08 10:23:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,300 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,331 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2024-11-08 10:23:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-08 10:23:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,336 INFO L225 Difference]: With dead ends: 1977 [2024-11-08 10:23:32,336 INFO L226 Difference]: Without dead ends: 1159 [2024-11-08 10:23:32,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,337 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-08 10:23:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2024-11-08 10:23:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2024-11-08 10:23:32,367 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2024-11-08 10:23:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,367 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2024-11-08 10:23:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2024-11-08 10:23:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:23:32,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:23:32,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2024-11-08 10:23:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376426564] [2024-11-08 10:23:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376426564] [2024-11-08 10:23:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376426564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097516535] [2024-11-08 10:23:32,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,395 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,423 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2024-11-08 10:23:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 10:23:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,428 INFO L225 Difference]: With dead ends: 1737 [2024-11-08 10:23:32,428 INFO L226 Difference]: Without dead ends: 1175 [2024-11-08 10:23:32,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,429 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-11-08 10:23:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2024-11-08 10:23:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2024-11-08 10:23:32,460 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2024-11-08 10:23:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2024-11-08 10:23:32,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2024-11-08 10:23:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:23:32,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:23:32,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2024-11-08 10:23:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722495852] [2024-11-08 10:23:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722495852] [2024-11-08 10:23:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722495852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927846015] [2024-11-08 10:23:32,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,484 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,535 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2024-11-08 10:23:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 10:23:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,543 INFO L225 Difference]: With dead ends: 2121 [2024-11-08 10:23:32,543 INFO L226 Difference]: Without dead ends: 2119 [2024-11-08 10:23:32,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,544 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2024-11-08 10:23:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2024-11-08 10:23:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2024-11-08 10:23:32,600 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2024-11-08 10:23:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,600 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2024-11-08 10:23:32,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2024-11-08 10:23:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:23:32,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:23:32,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2024-11-08 10:23:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155615817] [2024-11-08 10:23:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155615817] [2024-11-08 10:23:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155615817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099479042] [2024-11-08 10:23:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,646 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,704 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2024-11-08 10:23:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 10:23:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,711 INFO L225 Difference]: With dead ends: 3913 [2024-11-08 10:23:32,711 INFO L226 Difference]: Without dead ends: 2279 [2024-11-08 10:23:32,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,715 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2024-11-08 10:23:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2024-11-08 10:23:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2024-11-08 10:23:32,777 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2024-11-08 10:23:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,777 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2024-11-08 10:23:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2024-11-08 10:23:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:32,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:23:32,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2024-11-08 10:23:32,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149263184] [2024-11-08 10:23:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149263184] [2024-11-08 10:23:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149263184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541949915] [2024-11-08 10:23:32,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,808 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:32,853 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2024-11-08 10:23:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:23:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:32,860 INFO L225 Difference]: With dead ends: 3417 [2024-11-08 10:23:32,860 INFO L226 Difference]: Without dead ends: 2311 [2024-11-08 10:23:32,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-11-08 10:23:32,862 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:32,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-11-08 10:23:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2024-11-08 10:23:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2024-11-08 10:23:32,942 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2024-11-08 10:23:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2024-11-08 10:23:32,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2024-11-08 10:23:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:32,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:32,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:32,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:23:32,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2024-11-08 10:23:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:32,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717068275] [2024-11-08 10:23:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717068275] [2024-11-08 10:23:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717068275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456047489] [2024-11-08 10:23:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:32,967 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:33,035 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2024-11-08 10:23:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:23:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:33,048 INFO L225 Difference]: With dead ends: 4105 [2024-11-08 10:23:33,048 INFO L226 Difference]: Without dead ends: 4103 [2024-11-08 10:23:33,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,049 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:33,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2024-11-08 10:23:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2024-11-08 10:23:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2024-11-08 10:23:33,131 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2024-11-08 10:23:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2024-11-08 10:23:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2024-11-08 10:23:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:23:33,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:33,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:33,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:23:33,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2024-11-08 10:23:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172495397] [2024-11-08 10:23:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172495397] [2024-11-08 10:23:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172495397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:33,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:33,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956231623] [2024-11-08 10:23:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:33,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:33,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,158 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:33,269 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2024-11-08 10:23:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:33,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:23:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:33,281 INFO L225 Difference]: With dead ends: 7753 [2024-11-08 10:23:33,281 INFO L226 Difference]: Without dead ends: 4487 [2024-11-08 10:23:33,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,284 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:33,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2024-11-08 10:23:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2024-11-08 10:23:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2024-11-08 10:23:33,406 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2024-11-08 10:23:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:33,406 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2024-11-08 10:23:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2024-11-08 10:23:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:33,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:33,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:23:33,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:33,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2024-11-08 10:23:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301123967] [2024-11-08 10:23:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301123967] [2024-11-08 10:23:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301123967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476648077] [2024-11-08 10:23:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,432 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:33,523 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2024-11-08 10:23:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 10:23:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:33,536 INFO L225 Difference]: With dead ends: 6729 [2024-11-08 10:23:33,536 INFO L226 Difference]: Without dead ends: 4551 [2024-11-08 10:23:33,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,539 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:33,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2024-11-08 10:23:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2024-11-08 10:23:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2024-11-08 10:23:33,657 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2024-11-08 10:23:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:33,657 INFO L471 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2024-11-08 10:23:33,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2024-11-08 10:23:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:33,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:33,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:33,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 10:23:33,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:33,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2024-11-08 10:23:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326005647] [2024-11-08 10:23:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326005647] [2024-11-08 10:23:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326005647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:33,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:33,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130678806] [2024-11-08 10:23:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:33,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:33,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,685 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:33,846 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2024-11-08 10:23:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:33,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 10:23:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:33,877 INFO L225 Difference]: With dead ends: 7945 [2024-11-08 10:23:33,877 INFO L226 Difference]: Without dead ends: 7943 [2024-11-08 10:23:33,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:33,879 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:33,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2024-11-08 10:23:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2024-11-08 10:23:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2024-11-08 10:23:34,066 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2024-11-08 10:23:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:34,066 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2024-11-08 10:23:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2024-11-08 10:23:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:23:34,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:34,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 10:23:34,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2024-11-08 10:23:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242875511] [2024-11-08 10:23:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242875511] [2024-11-08 10:23:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242875511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:34,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266322183] [2024-11-08 10:23:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:34,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:34,098 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:34,233 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2024-11-08 10:23:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 10:23:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:34,248 INFO L225 Difference]: With dead ends: 15369 [2024-11-08 10:23:34,249 INFO L226 Difference]: Without dead ends: 8839 [2024-11-08 10:23:34,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:34,258 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:34,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2024-11-08 10:23:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2024-11-08 10:23:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2024-11-08 10:23:34,490 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2024-11-08 10:23:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:34,491 INFO L471 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2024-11-08 10:23:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2024-11-08 10:23:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:34,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:34,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 10:23:34,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2024-11-08 10:23:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:34,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768695666] [2024-11-08 10:23:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:34,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768695666] [2024-11-08 10:23:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768695666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969785728] [2024-11-08 10:23:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:34,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:34,521 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:34,677 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2024-11-08 10:23:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 10:23:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:34,689 INFO L225 Difference]: With dead ends: 13257 [2024-11-08 10:23:34,689 INFO L226 Difference]: Without dead ends: 8967 [2024-11-08 10:23:34,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:34,694 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:34,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2024-11-08 10:23:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2024-11-08 10:23:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2024-11-08 10:23:34,963 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2024-11-08 10:23:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:34,964 INFO L471 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2024-11-08 10:23:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2024-11-08 10:23:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:34,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:34,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:34,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 10:23:34,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:34,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2024-11-08 10:23:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:34,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053965936] [2024-11-08 10:23:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053965936] [2024-11-08 10:23:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053965936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:34,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:34,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796550653] [2024-11-08 10:23:35,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:35,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:35,001 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:35,250 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2024-11-08 10:23:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 10:23:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:35,276 INFO L225 Difference]: With dead ends: 15369 [2024-11-08 10:23:35,276 INFO L226 Difference]: Without dead ends: 15367 [2024-11-08 10:23:35,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:35,283 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:35,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2024-11-08 10:23:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2024-11-08 10:23:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13317 states, 13316 states have (on average 1.3555872634424753) internal successors, (18051), 13316 states have internal predecessors, (18051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2024-11-08 10:23:35,615 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2024-11-08 10:23:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2024-11-08 10:23:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2024-11-08 10:23:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 10:23:35,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:35,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:35,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 10:23:35,631 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:35,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2024-11-08 10:23:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400436452] [2024-11-08 10:23:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400436452] [2024-11-08 10:23:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400436452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:35,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:35,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:35,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085365971] [2024-11-08 10:23:35,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:35,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:35,656 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:35,916 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2024-11-08 10:23:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:35,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 10:23:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:35,944 INFO L225 Difference]: With dead ends: 30473 [2024-11-08 10:23:35,945 INFO L226 Difference]: Without dead ends: 17415 [2024-11-08 10:23:35,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:35,957 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:35,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2024-11-08 10:23:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2024-11-08 10:23:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3381001608086378) internal successors, (23299), 17412 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2024-11-08 10:23:36,466 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2024-11-08 10:23:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:36,466 INFO L471 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2024-11-08 10:23:36,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2024-11-08 10:23:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:36,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:36,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 10:23:36,490 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:36,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2024-11-08 10:23:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:36,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795160126] [2024-11-08 10:23:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795160126] [2024-11-08 10:23:36,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795160126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755546675] [2024-11-08 10:23:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:36,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:36,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:36,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:36,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:36,521 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:36,842 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2024-11-08 10:23:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 10:23:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:36,880 INFO L225 Difference]: With dead ends: 26121 [2024-11-08 10:23:36,881 INFO L226 Difference]: Without dead ends: 17671 [2024-11-08 10:23:36,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:36,895 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:36,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2024-11-08 10:23:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2024-11-08 10:23:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.318711795336201) internal successors, (23299), 17668 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2024-11-08 10:23:37,375 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2024-11-08 10:23:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2024-11-08 10:23:37,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2024-11-08 10:23:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:37,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:37,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 10:23:37,387 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2024-11-08 10:23:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030006739] [2024-11-08 10:23:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030006739] [2024-11-08 10:23:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030006739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403224750] [2024-11-08 10:23:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:37,420 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:37,769 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2024-11-08 10:23:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 10:23:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:37,824 INFO L225 Difference]: With dead ends: 29705 [2024-11-08 10:23:37,824 INFO L226 Difference]: Without dead ends: 29703 [2024-11-08 10:23:37,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:37,832 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:37,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2024-11-08 10:23:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2024-11-08 10:23:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2787667117320114) internal successors, (34051), 26628 states have internal predecessors, (34051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2024-11-08 10:23:38,363 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2024-11-08 10:23:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:38,364 INFO L471 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2024-11-08 10:23:38,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2024-11-08 10:23:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 10:23:38,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:38,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:38,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 10:23:38,389 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:38,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2024-11-08 10:23:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:38,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021862420] [2024-11-08 10:23:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021862420] [2024-11-08 10:23:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021862420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899722370] [2024-11-08 10:23:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:38,417 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:38,921 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2024-11-08 10:23:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 10:23:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:38,970 INFO L225 Difference]: With dead ends: 60425 [2024-11-08 10:23:38,970 INFO L226 Difference]: Without dead ends: 34311 [2024-11-08 10:23:38,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:38,998 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:38,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2024-11-08 10:23:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2024-11-08 10:23:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2536726128016789) internal successors, (43011), 34308 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2024-11-08 10:23:40,002 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2024-11-08 10:23:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2024-11-08 10:23:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2024-11-08 10:23:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:40,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:40,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:40,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 10:23:40,022 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2024-11-08 10:23:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:40,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318379197] [2024-11-08 10:23:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318379197] [2024-11-08 10:23:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318379197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:40,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:40,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536785048] [2024-11-08 10:23:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:40,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:40,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:40,048 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:40,526 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2024-11-08 10:23:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 10:23:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:40,568 INFO L225 Difference]: With dead ends: 51465 [2024-11-08 10:23:40,568 INFO L226 Difference]: Without dead ends: 34823 [2024-11-08 10:23:40,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:40,588 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:40,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2024-11-08 10:23:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2024-11-08 10:23:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.23523836875359) internal successors, (43011), 34820 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2024-11-08 10:23:41,398 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2024-11-08 10:23:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:41,398 INFO L471 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2024-11-08 10:23:41,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2024-11-08 10:23:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:41,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:41,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 10:23:41,412 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2024-11-08 10:23:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41543036] [2024-11-08 10:23:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41543036] [2024-11-08 10:23:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41543036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577012180] [2024-11-08 10:23:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:41,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:41,432 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:42,332 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2024-11-08 10:23:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 10:23:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:42,411 INFO L225 Difference]: With dead ends: 101385 [2024-11-08 10:23:42,411 INFO L226 Difference]: Without dead ends: 67591 [2024-11-08 10:23:42,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:42,442 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:42,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2024-11-08 10:23:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2024-11-08 10:23:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1817926259099247) internal successors, (79875), 67588 states have internal predecessors, (79875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2024-11-08 10:23:43,840 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2024-11-08 10:23:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:43,841 INFO L471 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2024-11-08 10:23:43,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2024-11-08 10:23:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:23:43,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:43,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:43,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 10:23:43,875 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2024-11-08 10:23:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762479734] [2024-11-08 10:23:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762479734] [2024-11-08 10:23:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762479734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666706437] [2024-11-08 10:23:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:43,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:43,896 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:45,101 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2024-11-08 10:23:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:45,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 10:23:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:45,181 INFO L225 Difference]: With dead ends: 71689 [2024-11-08 10:23:45,182 INFO L226 Difference]: Without dead ends: 71687 [2024-11-08 10:23:45,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:45,198 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:45,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2024-11-08 10:23:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2024-11-08 10:23:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.166642007456945) internal successors, (78851), 67588 states have internal predecessors, (78851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2024-11-08 10:23:46,440 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2024-11-08 10:23:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:46,440 INFO L471 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2024-11-08 10:23:46,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2024-11-08 10:23:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:23:46,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:46,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:46,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 10:23:46,465 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:46,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2024-11-08 10:23:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692485179] [2024-11-08 10:23:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692485179] [2024-11-08 10:23:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692485179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940198054] [2024-11-08 10:23:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:46,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:46,493 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:48,083 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2024-11-08 10:23:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 10:23:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:48,201 INFO L225 Difference]: With dead ends: 109575 [2024-11-08 10:23:48,201 INFO L226 Difference]: Without dead ends: 109573 [2024-11-08 10:23:48,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:48,222 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:48,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2024-11-08 10:23:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2024-11-08 10:23:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105477 states, 105476 states have (on average 1.1456160643179492) internal successors, (120835), 105476 states have internal predecessors, (120835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2024-11-08 10:23:49,952 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2024-11-08 10:23:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:49,953 INFO L471 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2024-11-08 10:23:49,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2024-11-08 10:23:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 10:23:50,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:50,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 10:23:50,004 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:50,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2024-11-08 10:23:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393305704] [2024-11-08 10:23:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:23:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393305704] [2024-11-08 10:23:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393305704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:23:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784150986] [2024-11-08 10:23:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:50,026 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:52,091 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2024-11-08 10:23:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:52,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 10:23:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:52,096 INFO L225 Difference]: With dead ends: 236549 [2024-11-08 10:23:52,096 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:23:52,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:52,189 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:52,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:23:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:23:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:23:52,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-08 10:23:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:52,196 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:23:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:23:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:23:52,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:23:52,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:23:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 10:23:52,203 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:52,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:23:52,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:23:52,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:23:52 BoogieIcfgContainer [2024-11-08 10:23:52,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:23:52,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:23:52,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:23:52,237 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:23:52,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:30" (3/4) ... [2024-11-08 10:23:52,239 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:23:52,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-08 10:23:52,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:23:52,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:23:52,252 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:23:52,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:23:52,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:23:52,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:23:52,348 INFO L158 Benchmark]: Toolchain (without parser) took 22520.75ms. Allocated memory was 172.0MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 114.5MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-08 10:23:52,348 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:52,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.73ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 144.6MB in the end (delta: -30.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 10:23:52,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:23:52,349 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:23:52,349 INFO L158 Benchmark]: RCFGBuilder took 354.09ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 123.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 10:23:52,349 INFO L158 Benchmark]: TraceAbstraction took 21674.08ms. Allocated memory was 172.0MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 122.7MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-08 10:23:52,349 INFO L158 Benchmark]: Witness Printer took 110.55ms. Allocated memory is still 11.7GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:23:52,351 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.73ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 144.6MB in the end (delta: -30.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 172.0MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.09ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 123.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21674.08ms. Allocated memory was 172.0MB in the beginning and 11.7GB in the end (delta: 11.6GB). Free memory was 122.7MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 110.55ms. Allocated memory is still 11.7GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1627 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1627 mSDsluCounter, 5403 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2173 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3230 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 1702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-11-08 10:23:52,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE