./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30e99cc503a65b2b00d0d341e953b7b3e491fbf488860704d5a2cfc226394b22 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:40:00,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:40:00,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:40:00,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:40:00,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:40:00,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:40:00,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:40:00,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:40:00,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:40:00,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:40:00,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:40:00,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:40:00,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:40:00,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:40:00,179 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:40:00,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:40:00,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:40:00,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:40:00,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:40:00,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:40:00,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:40:00,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:40:00,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:40:00,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:40:00,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:40:00,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:40:00,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:40:00,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:40:00,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:40:00,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:40:00,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:40:00,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:40:00,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:00,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:40:00,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:40:00,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:40:00,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:40:00,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:40:00,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:40:00,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:40:00,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:40:00,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:40:00,192 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30e99cc503a65b2b00d0d341e953b7b3e491fbf488860704d5a2cfc226394b22 [2024-10-10 23:40:00,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:40:00,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:40:00,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:40:00,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:40:00,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:40:00,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c [2024-10-10 23:40:01,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:40:02,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:40:02,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c [2024-10-10 23:40:02,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd14afa1a/29a9cbbbd01d4d88962722acdce2c63d/FLAGcfacd795c [2024-10-10 23:40:02,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd14afa1a/29a9cbbbd01d4d88962722acdce2c63d [2024-10-10 23:40:02,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:40:02,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:40:02,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:02,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:40:02,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:40:02,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:02" (1/1) ... [2024-10-10 23:40:02,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4c29e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:02, skipping insertion in model container [2024-10-10 23:40:02,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:40:02" (1/1) ... [2024-10-10 23:40:02,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:40:02,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c[1375,1388] [2024-10-10 23:40:02,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:02,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:40:03,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label06.c[1375,1388] [2024-10-10 23:40:03,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:40:03,248 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:40:03,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03 WrapperNode [2024-10-10 23:40:03,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:40:03,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:03,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:40:03,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:40:03,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,425 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:40:03,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:40:03,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:40:03,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:40:03,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:40:03,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,533 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:40:03,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:40:03,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:40:03,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:40:03,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:40:03,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (1/1) ... [2024-10-10 23:40:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:40:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:03,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:40:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:40:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:40:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:40:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:40:03,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:40:03,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:40:03,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:40:05,707 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:40:05,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:40:05,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:40:05,762 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:40:05,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:05 BoogieIcfgContainer [2024-10-10 23:40:05,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:40:05,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:40:05,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:40:05,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:40:05,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:40:02" (1/3) ... [2024-10-10 23:40:05,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8acf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:05, skipping insertion in model container [2024-10-10 23:40:05,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:40:03" (2/3) ... [2024-10-10 23:40:05,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8acf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:40:05, skipping insertion in model container [2024-10-10 23:40:05,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:40:05" (3/3) ... [2024-10-10 23:40:05,772 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label06.c [2024-10-10 23:40:05,789 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:40:05,789 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:40:05,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:40:05,861 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;@1a77e092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:40:05,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:40:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:40:05,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:05,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:05,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -614471513, now seen corresponding path program 1 times [2024-10-10 23:40:05,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350698170] [2024-10-10 23:40:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350698170] [2024-10-10 23:40:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350698170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:06,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:06,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:06,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206185946] [2024-10-10 23:40:06,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:40:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:40:06,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:06,050 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:06,119 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:40:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:40:06,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:40:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:06,139 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:40:06,139 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:40:06,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:40:06,149 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:06,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:40:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:40:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:40:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:40:06,205 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 9 [2024-10-10 23:40:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:06,205 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:40:06,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:40:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:40:06,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:06,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:06,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:40:06,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:06,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1957237310, now seen corresponding path program 1 times [2024-10-10 23:40:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478545904] [2024-10-10 23:40:06,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478545904] [2024-10-10 23:40:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478545904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:06,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375799587] [2024-10-10 23:40:06,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:06,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:06,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:06,337 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:07,920 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:40:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:40:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:07,924 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:40:07,924 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:40:07,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:07,928 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 340 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:07,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 77 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:40:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:40:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:40:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.7015151515151514) internal successors, (1123), 660 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1123 transitions. [2024-10-10 23:40:07,971 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1123 transitions. Word has length 9 [2024-10-10 23:40:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:07,971 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1123 transitions. [2024-10-10 23:40:07,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1123 transitions. [2024-10-10 23:40:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 23:40:07,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:07,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:40:07,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1230810205, now seen corresponding path program 1 times [2024-10-10 23:40:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558831753] [2024-10-10 23:40:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558831753] [2024-10-10 23:40:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558831753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:08,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:08,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445432452] [2024-10-10 23:40:08,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:08,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:08,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:08,244 INFO L87 Difference]: Start difference. First operand 661 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:09,502 INFO L93 Difference]: Finished difference Result 1979 states and 3366 transitions. [2024-10-10 23:40:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-10 23:40:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:09,508 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:40:09,508 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:40:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:09,511 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:09,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 75 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:40:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:40:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:40:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.6206373292867982) internal successors, (2136), 1318 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 2136 transitions. [2024-10-10 23:40:09,542 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 2136 transitions. Word has length 75 [2024-10-10 23:40:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:09,543 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 2136 transitions. [2024-10-10 23:40:09,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 2136 transitions. [2024-10-10 23:40:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-10 23:40:09,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:09,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:09,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:40:09,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:09,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1847038455, now seen corresponding path program 1 times [2024-10-10 23:40:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415247416] [2024-10-10 23:40:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415247416] [2024-10-10 23:40:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415247416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503785094] [2024-10-10 23:40:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:09,669 INFO L87 Difference]: Start difference. First operand 1319 states and 2136 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:10,847 INFO L93 Difference]: Finished difference Result 3295 states and 5284 transitions. [2024-10-10 23:40:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-10 23:40:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:10,855 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:40:10,855 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:40:10,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:10,860 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:10,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 153 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:40:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:40:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:40:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.33248987854251) internal successors, (2633), 1976 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2633 transitions. [2024-10-10 23:40:10,900 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2633 transitions. Word has length 76 [2024-10-10 23:40:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:10,900 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2633 transitions. [2024-10-10 23:40:10,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2633 transitions. [2024-10-10 23:40:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-10 23:40:10,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:10,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:10,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:40:10,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:10,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 747091345, now seen corresponding path program 1 times [2024-10-10 23:40:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:10,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905927326] [2024-10-10 23:40:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905927326] [2024-10-10 23:40:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905927326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:40:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217755378] [2024-10-10 23:40:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:11,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:11,200 INFO L87 Difference]: Start difference. First operand 1977 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:12,419 INFO L93 Difference]: Finished difference Result 5927 states and 7896 transitions. [2024-10-10 23:40:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-10-10 23:40:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:12,432 INFO L225 Difference]: With dead ends: 5927 [2024-10-10 23:40:12,433 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:12,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:12,438 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:12,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 257 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:40:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-10 23:40:12,504 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 168 [2024-10-10 23:40:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:12,506 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-10 23:40:12,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-10 23:40:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:40:12,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:12,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:40:12,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash 410589178, now seen corresponding path program 1 times [2024-10-10 23:40:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679519597] [2024-10-10 23:40:12,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:12,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679519597] [2024-10-10 23:40:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679519597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006975454] [2024-10-10 23:40:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:13,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:13,166 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:14,411 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-10 23:40:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:14,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-10-10 23:40:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:14,425 INFO L225 Difference]: With dead ends: 8230 [2024-10-10 23:40:14,426 INFO L226 Difference]: Without dead ends: 4280 [2024-10-10 23:40:14,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:14,431 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:14,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:40:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-10 23:40:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-10 23:40:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-10 23:40:14,550 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 254 [2024-10-10 23:40:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:14,551 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-10 23:40:14,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-10 23:40:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-10 23:40:14,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:14,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:14,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:40:14,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:14,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1516837203, now seen corresponding path program 1 times [2024-10-10 23:40:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387233541] [2024-10-10 23:40:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387233541] [2024-10-10 23:40:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387233541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:40:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374861066] [2024-10-10 23:40:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:15,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:40:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:40:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:15,385 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:17,147 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-10 23:40:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:40:17,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 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 341 [2024-10-10 23:40:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:17,159 INFO L225 Difference]: With dead ends: 8089 [2024-10-10 23:40:17,159 INFO L226 Difference]: Without dead ends: 3951 [2024-10-10 23:40:17,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:17,165 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 314 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:17,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 285 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:40:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-10 23:40:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-10 23:40:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-10 23:40:17,224 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 341 [2024-10-10 23:40:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:17,224 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-10 23:40:17,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-10 23:40:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:40:17,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:17,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:17,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:40:17,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:17,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -827225805, now seen corresponding path program 1 times [2024-10-10 23:40:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597132227] [2024-10-10 23:40:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-10 23:40:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597132227] [2024-10-10 23:40:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597132227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425371037] [2024-10-10 23:40:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:17,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:17,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:17,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:40:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:17,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:40:17,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:40:17,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425371037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:40:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148283986] [2024-10-10 23:40:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:17,965 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:18,807 INFO L93 Difference]: Finished difference Result 9217 states and 10059 transitions. [2024-10-10 23:40:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 348 [2024-10-10 23:40:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:18,824 INFO L225 Difference]: With dead ends: 9217 [2024-10-10 23:40:18,824 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:40:18,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:18,829 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 325 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:18,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 403 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:40:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:40:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:40:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0748882931188561) internal successors, (6014), 5595 states have internal predecessors, (6014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6014 transitions. [2024-10-10 23:40:18,911 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6014 transitions. Word has length 348 [2024-10-10 23:40:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:18,912 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6014 transitions. [2024-10-10 23:40:18,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6014 transitions. [2024-10-10 23:40:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-10-10 23:40:18,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:18,920 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:18,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:40:19,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:19,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2136266276, now seen corresponding path program 1 times [2024-10-10 23:40:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910340865] [2024-10-10 23:40:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910340865] [2024-10-10 23:40:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910340865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192361933] [2024-10-10 23:40:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:19,416 INFO L87 Difference]: Start difference. First operand 5596 states and 6014 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:20,339 INFO L93 Difference]: Finished difference Result 10862 states and 11696 transitions. [2024-10-10 23:40:20,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:20,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2024-10-10 23:40:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:20,355 INFO L225 Difference]: With dead ends: 10862 [2024-10-10 23:40:20,355 INFO L226 Difference]: Without dead ends: 5596 [2024-10-10 23:40:20,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:20,361 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:20,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 58 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2024-10-10 23:40:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2024-10-10 23:40:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0620196604110814) internal successors, (5942), 5595 states have internal predecessors, (5942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 5942 transitions. [2024-10-10 23:40:20,429 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 5942 transitions. Word has length 403 [2024-10-10 23:40:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:20,430 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 5942 transitions. [2024-10-10 23:40:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 5942 transitions. [2024-10-10 23:40:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-10-10 23:40:20,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:20,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:20,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:40:20,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:20,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1894646962, now seen corresponding path program 1 times [2024-10-10 23:40:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908619667] [2024-10-10 23:40:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:40:20,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:20,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908619667] [2024-10-10 23:40:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908619667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:20,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768811145] [2024-10-10 23:40:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:20,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:20,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:20,932 INFO L87 Difference]: Start difference. First operand 5596 states and 5942 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:22,247 INFO L93 Difference]: Finished difference Result 16455 states and 17511 transitions. [2024-10-10 23:40:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 487 [2024-10-10 23:40:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:22,271 INFO L225 Difference]: With dead ends: 16455 [2024-10-10 23:40:22,271 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:40:22,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:22,276 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 192 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:22,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 85 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:40:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:40:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 10860. [2024-10-10 23:40:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0593056450870246) internal successors, (11503), 10859 states have internal predecessors, (11503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11503 transitions. [2024-10-10 23:40:22,412 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11503 transitions. Word has length 487 [2024-10-10 23:40:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:22,413 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11503 transitions. [2024-10-10 23:40:22,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11503 transitions. [2024-10-10 23:40:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-10-10 23:40:22,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:22,421 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:22,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:40:22,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:22,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1924403204, now seen corresponding path program 1 times [2024-10-10 23:40:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104640195] [2024-10-10 23:40:22,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:40:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104640195] [2024-10-10 23:40:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104640195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971194506] [2024-10-10 23:40:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:22,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:22,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:22,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:22,721 INFO L87 Difference]: Start difference. First operand 10860 states and 11503 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:23,535 INFO L93 Difference]: Finished difference Result 24022 states and 25474 transitions. [2024-10-10 23:40:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 507 [2024-10-10 23:40:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:23,557 INFO L225 Difference]: With dead ends: 24022 [2024-10-10 23:40:23,557 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:40:23,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:23,569 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:23,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 36 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:40:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:40:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13163. [2024-10-10 23:40:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.055310743048169) internal successors, (13890), 13162 states have internal predecessors, (13890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13890 transitions. [2024-10-10 23:40:23,727 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13890 transitions. Word has length 507 [2024-10-10 23:40:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:23,728 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13890 transitions. [2024-10-10 23:40:23,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13890 transitions. [2024-10-10 23:40:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-10-10 23:40:23,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:23,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:40:23,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1711218691, now seen corresponding path program 1 times [2024-10-10 23:40:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704204820] [2024-10-10 23:40:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:40:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704204820] [2024-10-10 23:40:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704204820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632852560] [2024-10-10 23:40:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:24,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:24,567 INFO L87 Difference]: Start difference. First operand 13163 states and 13890 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:25,507 INFO L93 Difference]: Finished difference Result 25667 states and 27111 transitions. [2024-10-10 23:40:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:25,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 561 [2024-10-10 23:40:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:25,530 INFO L225 Difference]: With dead ends: 25667 [2024-10-10 23:40:25,530 INFO L226 Difference]: Without dead ends: 13163 [2024-10-10 23:40:25,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:25,544 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:25,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 116 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:40:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-10 23:40:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 13163. [2024-10-10 23:40:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0550068378665856) internal successors, (13886), 13162 states have internal predecessors, (13886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13886 transitions. [2024-10-10 23:40:25,758 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13886 transitions. Word has length 561 [2024-10-10 23:40:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:25,758 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13886 transitions. [2024-10-10 23:40:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13886 transitions. [2024-10-10 23:40:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-10-10 23:40:25,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:25,765 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:25,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:40:25,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1468301193, now seen corresponding path program 1 times [2024-10-10 23:40:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621012230] [2024-10-10 23:40:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-10 23:40:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621012230] [2024-10-10 23:40:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621012230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:26,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940007156] [2024-10-10 23:40:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:26,203 INFO L87 Difference]: Start difference. First operand 13163 states and 13886 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:26,957 INFO L93 Difference]: Finished difference Result 25667 states and 27107 transitions. [2024-10-10 23:40:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:26,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 622 [2024-10-10 23:40:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:26,976 INFO L225 Difference]: With dead ends: 25667 [2024-10-10 23:40:26,976 INFO L226 Difference]: Without dead ends: 13163 [2024-10-10 23:40:26,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:26,989 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 337 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:26,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 424 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-10 23:40:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 11847. [2024-10-10 23:40:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.052929258821543) internal successors, (12473), 11846 states have internal predecessors, (12473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 12473 transitions. [2024-10-10 23:40:27,124 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 12473 transitions. Word has length 622 [2024-10-10 23:40:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 12473 transitions. [2024-10-10 23:40:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 12473 transitions. [2024-10-10 23:40:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2024-10-10 23:40:27,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:27,136 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:27,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:40:27,136 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 247225556, now seen corresponding path program 1 times [2024-10-10 23:40:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941462120] [2024-10-10 23:40:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-10 23:40:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:27,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941462120] [2024-10-10 23:40:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941462120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:27,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:27,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256222215] [2024-10-10 23:40:27,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:27,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:27,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:27,707 INFO L87 Difference]: Start difference. First operand 11847 states and 12473 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:28,489 INFO L93 Difference]: Finished difference Result 25996 states and 27428 transitions. [2024-10-10 23:40:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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 811 [2024-10-10 23:40:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:28,509 INFO L225 Difference]: With dead ends: 25996 [2024-10-10 23:40:28,509 INFO L226 Difference]: Without dead ends: 14808 [2024-10-10 23:40:28,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:28,520 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:28,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 440 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14808 states. [2024-10-10 23:40:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14808 to 14150. [2024-10-10 23:40:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.0501802247508658) internal successors, (14859), 14149 states have internal predecessors, (14859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14859 transitions. [2024-10-10 23:40:28,668 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14859 transitions. Word has length 811 [2024-10-10 23:40:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:28,670 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14859 transitions. [2024-10-10 23:40:28,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14859 transitions. [2024-10-10 23:40:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2024-10-10 23:40:28,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:28,684 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:40:28,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1529790144, now seen corresponding path program 1 times [2024-10-10 23:40:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455972392] [2024-10-10 23:40:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 24 proven. 555 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-10-10 23:40:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455972392] [2024-10-10 23:40:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455972392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40429529] [2024-10-10 23:40:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:30,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:30,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:40:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:30,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:40:30,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-10-10 23:40:30,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40429529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:30,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:40:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492870962] [2024-10-10 23:40:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:30,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:30,332 INFO L87 Difference]: Start difference. First operand 14150 states and 14859 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:31,026 INFO L93 Difference]: Finished difference Result 27641 states and 29053 transitions. [2024-10-10 23:40:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 820 [2024-10-10 23:40:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:31,043 INFO L225 Difference]: With dead ends: 27641 [2024-10-10 23:40:31,043 INFO L226 Difference]: Without dead ends: 14150 [2024-10-10 23:40:31,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:31,057 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 357 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:31,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 374 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2024-10-10 23:40:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 14150. [2024-10-10 23:40:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.043041911089123) internal successors, (14758), 14149 states have internal predecessors, (14758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14758 transitions. [2024-10-10 23:40:31,247 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14758 transitions. Word has length 820 [2024-10-10 23:40:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14758 transitions. [2024-10-10 23:40:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14758 transitions. [2024-10-10 23:40:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2024-10-10 23:40:31,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:31,261 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:31,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:40:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:40:31,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:31,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1662505393, now seen corresponding path program 1 times [2024-10-10 23:40:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993984889] [2024-10-10 23:40:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2024-10-10 23:40:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:31,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993984889] [2024-10-10 23:40:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993984889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:31,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277111119] [2024-10-10 23:40:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:31,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:31,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:31,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:31,974 INFO L87 Difference]: Start difference. First operand 14150 states and 14758 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:32,727 INFO L93 Difference]: Finished difference Result 33563 states and 35104 transitions. [2024-10-10 23:40:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 837 [2024-10-10 23:40:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:32,748 INFO L225 Difference]: With dead ends: 33563 [2024-10-10 23:40:32,749 INFO L226 Difference]: Without dead ends: 18756 [2024-10-10 23:40:32,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:32,761 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 270 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:32,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 426 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18756 states. [2024-10-10 23:40:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18756 to 17440. [2024-10-10 23:40:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17440 states, 17439 states have (on average 1.0352084408509663) internal successors, (18053), 17439 states have internal predecessors, (18053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17440 states to 17440 states and 18053 transitions. [2024-10-10 23:40:32,957 INFO L78 Accepts]: Start accepts. Automaton has 17440 states and 18053 transitions. Word has length 837 [2024-10-10 23:40:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:32,958 INFO L471 AbstractCegarLoop]: Abstraction has 17440 states and 18053 transitions. [2024-10-10 23:40:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17440 states and 18053 transitions. [2024-10-10 23:40:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2024-10-10 23:40:32,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:32,980 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:32,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:40:32,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:32,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1828356536, now seen corresponding path program 1 times [2024-10-10 23:40:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171471821] [2024-10-10 23:40:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 1630 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-10-10 23:40:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171471821] [2024-10-10 23:40:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171471821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535933688] [2024-10-10 23:40:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:33,671 INFO L87 Difference]: Start difference. First operand 17440 states and 18053 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:34,360 INFO L93 Difference]: Finished difference Result 34221 states and 35441 transitions. [2024-10-10 23:40:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1093 [2024-10-10 23:40:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:34,376 INFO L225 Difference]: With dead ends: 34221 [2024-10-10 23:40:34,376 INFO L226 Difference]: Without dead ends: 17440 [2024-10-10 23:40:34,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:34,388 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:34,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 427 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17440 states. [2024-10-10 23:40:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17440 to 16124. [2024-10-10 23:40:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0303913663710227) internal successors, (16613), 16123 states have internal predecessors, (16613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16613 transitions. [2024-10-10 23:40:34,543 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16613 transitions. Word has length 1093 [2024-10-10 23:40:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:34,543 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16613 transitions. [2024-10-10 23:40:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16613 transitions. [2024-10-10 23:40:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2024-10-10 23:40:34,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:34,562 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:40:34,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1554360737, now seen corresponding path program 1 times [2024-10-10 23:40:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500995279] [2024-10-10 23:40:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-10 23:40:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500995279] [2024-10-10 23:40:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500995279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696619642] [2024-10-10 23:40:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:35,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:35,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:35,236 INFO L87 Difference]: Start difference. First operand 16124 states and 16613 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:36,012 INFO L93 Difference]: Finished difference Result 34550 states and 35661 transitions. [2024-10-10 23:40:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 1094 [2024-10-10 23:40:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:36,032 INFO L225 Difference]: With dead ends: 34550 [2024-10-10 23:40:36,032 INFO L226 Difference]: Without dead ends: 16782 [2024-10-10 23:40:36,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:36,047 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 273 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:36,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 411 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-10 23:40:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 14808. [2024-10-10 23:40:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0258661443911663) internal successors, (15190), 14807 states have internal predecessors, (15190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15190 transitions. [2024-10-10 23:40:36,173 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15190 transitions. Word has length 1094 [2024-10-10 23:40:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15190 transitions. [2024-10-10 23:40:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15190 transitions. [2024-10-10 23:40:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2024-10-10 23:40:36,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:36,187 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:40:36,188 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1218401062, now seen corresponding path program 1 times [2024-10-10 23:40:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362666301] [2024-10-10 23:40:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2593 backedges. 1849 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2024-10-10 23:40:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362666301] [2024-10-10 23:40:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362666301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:37,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:37,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:40:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260688629] [2024-10-10 23:40:37,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:40:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:40:37,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:37,403 INFO L87 Difference]: Start difference. First operand 14808 states and 15190 transitions. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:38,400 INFO L93 Difference]: Finished difference Result 28958 states and 29716 transitions. [2024-10-10 23:40:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:40:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 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 1222 [2024-10-10 23:40:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:38,413 INFO L225 Difference]: With dead ends: 28958 [2024-10-10 23:40:38,413 INFO L226 Difference]: Without dead ends: 14809 [2024-10-10 23:40:38,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:40:38,421 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 357 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:38,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 554 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2024-10-10 23:40:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14808. [2024-10-10 23:40:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0255960018909975) internal successors, (15186), 14807 states have internal predecessors, (15186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15186 transitions. [2024-10-10 23:40:38,550 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15186 transitions. Word has length 1222 [2024-10-10 23:40:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:38,551 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15186 transitions. [2024-10-10 23:40:38,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15186 transitions. [2024-10-10 23:40:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2024-10-10 23:40:38,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:38,565 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:38,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:40:38,565 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1342673455, now seen corresponding path program 1 times [2024-10-10 23:40:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:38,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142318741] [2024-10-10 23:40:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1803 proven. 0 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-10-10 23:40:39,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142318741] [2024-10-10 23:40:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142318741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:40:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526097015] [2024-10-10 23:40:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:39,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:39,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:39,785 INFO L87 Difference]: Start difference. First operand 14808 states and 15186 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:40,813 INFO L93 Difference]: Finished difference Result 28969 states and 29719 transitions. [2024-10-10 23:40:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:40:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 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 1236 [2024-10-10 23:40:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:40,828 INFO L225 Difference]: With dead ends: 28969 [2024-10-10 23:40:40,828 INFO L226 Difference]: Without dead ends: 14820 [2024-10-10 23:40:40,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:40,838 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:40,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 435 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14820 states. [2024-10-10 23:40:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14820 to 14808. [2024-10-10 23:40:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0253258593908288) internal successors, (15182), 14807 states have internal predecessors, (15182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15182 transitions. [2024-10-10 23:40:41,012 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15182 transitions. Word has length 1236 [2024-10-10 23:40:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15182 transitions. [2024-10-10 23:40:41,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15182 transitions. [2024-10-10 23:40:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2024-10-10 23:40:41,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:41,036 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:40:41,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2058894117, now seen corresponding path program 1 times [2024-10-10 23:40:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665834619] [2024-10-10 23:40:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3245 backedges. 1864 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2024-10-10 23:40:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665834619] [2024-10-10 23:40:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665834619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:42,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:42,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490131420] [2024-10-10 23:40:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:42,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:42,204 INFO L87 Difference]: Start difference. First operand 14808 states and 15182 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:42,870 INFO L93 Difference]: Finished difference Result 29615 states and 30365 transitions. [2024-10-10 23:40:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1251 [2024-10-10 23:40:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:42,885 INFO L225 Difference]: With dead ends: 29615 [2024-10-10 23:40:42,885 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:40:42,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:42,894 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:42,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:40:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2024-10-10 23:40:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.0245069511800842) internal successors, (15844), 15465 states have internal predecessors, (15844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15844 transitions. [2024-10-10 23:40:43,005 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15844 transitions. Word has length 1251 [2024-10-10 23:40:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:43,006 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15844 transitions. [2024-10-10 23:40:43,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15844 transitions. [2024-10-10 23:40:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2024-10-10 23:40:43,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:43,018 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:40:43,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:43,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1139611503, now seen corresponding path program 1 times [2024-10-10 23:40:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427424278] [2024-10-10 23:40:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 1959 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2024-10-10 23:40:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427424278] [2024-10-10 23:40:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427424278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:40:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934182514] [2024-10-10 23:40:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:40:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:40:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:44,039 INFO L87 Difference]: Start difference. First operand 15466 states and 15844 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:45,045 INFO L93 Difference]: Finished difference Result 30273 states and 31023 transitions. [2024-10-10 23:40:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1276 [2024-10-10 23:40:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:45,057 INFO L225 Difference]: With dead ends: 30273 [2024-10-10 23:40:45,057 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:40:45,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:40:45,066 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 120 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 552 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:40:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:40:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 15466. [2024-10-10 23:40:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.0238603297769155) internal successors, (15834), 15465 states have internal predecessors, (15834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15834 transitions. [2024-10-10 23:40:45,176 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15834 transitions. Word has length 1276 [2024-10-10 23:40:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15834 transitions. [2024-10-10 23:40:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15834 transitions. [2024-10-10 23:40:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2024-10-10 23:40:45,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:45,192 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:40:45,193 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -203818496, now seen corresponding path program 1 times [2024-10-10 23:40:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995170330] [2024-10-10 23:40:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3264 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2024-10-10 23:40:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995170330] [2024-10-10 23:40:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995170330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:45,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860960885] [2024-10-10 23:40:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:45,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:45,870 INFO L87 Difference]: Start difference. First operand 15466 states and 15834 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:46,615 INFO L93 Difference]: Finished difference Result 30602 states and 31336 transitions. [2024-10-10 23:40:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 1305 [2024-10-10 23:40:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:46,628 INFO L225 Difference]: With dead ends: 30602 [2024-10-10 23:40:46,628 INFO L226 Difference]: Without dead ends: 15466 [2024-10-10 23:40:46,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:46,638 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 268 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:46,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 408 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2024-10-10 23:40:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 14808. [2024-10-10 23:40:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0184372256365233) internal successors, (15080), 14807 states have internal predecessors, (15080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15080 transitions. [2024-10-10 23:40:46,735 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15080 transitions. Word has length 1305 [2024-10-10 23:40:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:46,736 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15080 transitions. [2024-10-10 23:40:46,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15080 transitions. [2024-10-10 23:40:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2024-10-10 23:40:46,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:46,751 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:40:46,752 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -8088085, now seen corresponding path program 1 times [2024-10-10 23:40:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639202222] [2024-10-10 23:40:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3737 backedges. 1001 proven. 0 refuted. 0 times theorem prover too weak. 2736 trivial. 0 not checked. [2024-10-10 23:40:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639202222] [2024-10-10 23:40:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639202222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:47,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458934847] [2024-10-10 23:40:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:47,363 INFO L87 Difference]: Start difference. First operand 14808 states and 15080 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:48,082 INFO L93 Difference]: Finished difference Result 28957 states and 29497 transitions. [2024-10-10 23:40:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 1403 [2024-10-10 23:40:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:48,097 INFO L225 Difference]: With dead ends: 28957 [2024-10-10 23:40:48,097 INFO L226 Difference]: Without dead ends: 13492 [2024-10-10 23:40:48,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:48,107 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 168 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:48,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 414 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2024-10-10 23:40:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13163. [2024-10-10 23:40:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.013447804285063) internal successors, (13339), 13162 states have internal predecessors, (13339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13339 transitions. [2024-10-10 23:40:48,229 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13339 transitions. Word has length 1403 [2024-10-10 23:40:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:48,230 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13339 transitions. [2024-10-10 23:40:48,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13339 transitions. [2024-10-10 23:40:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1762 [2024-10-10 23:40:48,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:48,270 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:40:48,270 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 890570986, now seen corresponding path program 1 times [2024-10-10 23:40:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481864494] [2024-10-10 23:40:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 4199 proven. 6 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2024-10-10 23:40:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481864494] [2024-10-10 23:40:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481864494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059508880] [2024-10-10 23:40:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:50,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:50,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:50,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:40:50,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:40:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:50,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 23:40:50,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2364 proven. 201 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2024-10-10 23:40:53,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:40:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2364 proven. 201 refuted. 0 times theorem prover too weak. 2723 trivial. 0 not checked. [2024-10-10 23:40:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059508880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:40:57,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:40:57,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-10-10 23:40:57,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301417964] [2024-10-10 23:40:57,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:40:57,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:40:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:40:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:40:57,200 INFO L87 Difference]: Start difference. First operand 13163 states and 13339 transitions. Second operand has 10 states, 10 states have (on average 225.3) internal successors, (2253), 10 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:00,855 INFO L93 Difference]: Finished difference Result 24022 states and 24357 transitions. [2024-10-10 23:41:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 23:41:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 225.3) internal successors, (2253), 10 states have internal predecessors, (2253), 0 states have call successors, (0), 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 1761 [2024-10-10 23:41:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:00,867 INFO L225 Difference]: With dead ends: 24022 [2024-10-10 23:41:00,867 INFO L226 Difference]: Without dead ends: 13821 [2024-10-10 23:41:00,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3532 GetRequests, 3521 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-10 23:41:00,874 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 867 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7566 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 7566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:00,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 86 Invalid, 7723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 7566 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:41:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-10 23:41:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13492. [2024-10-10 23:41:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.012156252316359) internal successors, (13655), 13491 states have internal predecessors, (13655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13655 transitions. [2024-10-10 23:41:00,965 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13655 transitions. Word has length 1761 [2024-10-10 23:41:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:00,965 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13655 transitions. [2024-10-10 23:41:00,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 225.3) internal successors, (2253), 10 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13655 transitions. [2024-10-10 23:41:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1894 [2024-10-10 23:41:00,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:00,994 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:01,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:41:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:41:01,195 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1622644742, now seen corresponding path program 1 times [2024-10-10 23:41:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541194662] [2024-10-10 23:41:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6423 backedges. 3404 proven. 0 refuted. 0 times theorem prover too weak. 3019 trivial. 0 not checked. [2024-10-10 23:41:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541194662] [2024-10-10 23:41:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541194662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:41:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:41:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869182852] [2024-10-10 23:41:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:02,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:02,983 INFO L87 Difference]: Start difference. First operand 13492 states and 13655 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:03,704 INFO L93 Difference]: Finished difference Result 26983 states and 27330 transitions. [2024-10-10 23:41:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:03,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 1893 [2024-10-10 23:41:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:03,717 INFO L225 Difference]: With dead ends: 26983 [2024-10-10 23:41:03,717 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:41:03,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:41:03,722 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 206 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:03,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 44 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:41:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:41:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 12834. [2024-10-10 23:41:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0116106911867842) internal successors, (12982), 12833 states have internal predecessors, (12982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 12982 transitions. [2024-10-10 23:41:03,815 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 12982 transitions. Word has length 1893 [2024-10-10 23:41:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 12982 transitions. [2024-10-10 23:41:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 12982 transitions. [2024-10-10 23:41:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2291 [2024-10-10 23:41:03,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:03,841 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 23:41:03,841 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1683645422, now seen corresponding path program 1 times [2024-10-10 23:41:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744891664] [2024-10-10 23:41:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10363 backedges. 7645 proven. 450 refuted. 0 times theorem prover too weak. 2268 trivial. 0 not checked. [2024-10-10 23:41:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:07,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744891664] [2024-10-10 23:41:07,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744891664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:41:07,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989807728] [2024-10-10 23:41:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:41:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:41:07,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:41:07,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:41:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:07,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 2641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:41:07,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:41:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10363 backedges. 6269 proven. 0 refuted. 0 times theorem prover too weak. 4094 trivial. 0 not checked. [2024-10-10 23:41:08,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:41:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989807728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:41:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-10 23:41:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741654141] [2024-10-10 23:41:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:08,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:41:08,484 INFO L87 Difference]: Start difference. First operand 12834 states and 12982 transitions. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:09,100 INFO L93 Difference]: Finished difference Result 22377 states and 22649 transitions. [2024-10-10 23:41:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 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 2290 [2024-10-10 23:41:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:09,110 INFO L225 Difference]: With dead ends: 22377 [2024-10-10 23:41:09,110 INFO L226 Difference]: Without dead ends: 12834 [2024-10-10 23:41:09,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2300 GetRequests, 2294 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:41:09,117 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:09,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 415 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:41:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2024-10-10 23:41:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2024-10-10 23:41:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.01137691888101) internal successors, (12979), 12833 states have internal predecessors, (12979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 12979 transitions. [2024-10-10 23:41:09,200 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 12979 transitions. Word has length 2290 [2024-10-10 23:41:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 12979 transitions. [2024-10-10 23:41:09,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 12979 transitions. [2024-10-10 23:41:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2312 [2024-10-10 23:41:09,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:09,268 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:09,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:41:09,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-10 23:41:09,469 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:09,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -602047086, now seen corresponding path program 1 times [2024-10-10 23:41:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019982342] [2024-10-10 23:41:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10110 backedges. 7087 proven. 140 refuted. 0 times theorem prover too weak. 2883 trivial. 0 not checked. [2024-10-10 23:41:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:41:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019982342] [2024-10-10 23:41:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019982342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:41:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593084513] [2024-10-10 23:41:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:11,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:41:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:41:11,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:41:11,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:41:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:41:12,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 2656 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:41:12,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:41:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10110 backedges. 5600 proven. 0 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2024-10-10 23:41:12,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:41:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593084513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:41:12,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:41:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-10 23:41:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505246324] [2024-10-10 23:41:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:41:12,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:41:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:41:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:41:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:41:12,577 INFO L87 Difference]: Start difference. First operand 12834 states and 12979 transitions. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:41:13,275 INFO L93 Difference]: Finished difference Result 24680 states and 24979 transitions. [2024-10-10 23:41:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:41:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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 2311 [2024-10-10 23:41:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:41:13,288 INFO L225 Difference]: With dead ends: 24680 [2024-10-10 23:41:13,288 INFO L226 Difference]: Without dead ends: 15137 [2024-10-10 23:41:13,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2316 GetRequests, 2311 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:41:13,297 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:41:13,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 411 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:41:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2024-10-10 23:41:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 14479. [2024-10-10 23:41:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.011120320486255) internal successors, (14639), 14478 states have internal predecessors, (14639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14639 transitions. [2024-10-10 23:41:13,415 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14639 transitions. Word has length 2311 [2024-10-10 23:41:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:41:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14639 transitions. [2024-10-10 23:41:13,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:41:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14639 transitions. [2024-10-10 23:41:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2343 [2024-10-10 23:41:13,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:41:13,443 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:41:13,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:41:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-10 23:41:13,644 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:41:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:41:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -262554921, now seen corresponding path program 1 times [2024-10-10 23:41:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:41:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636255483] [2024-10-10 23:41:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:41:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:41:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat