./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/Problem17_label01.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/Problem17_label01.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 a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:44:28,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:44:28,371 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:44:28,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:44:28,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:44:28,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:44:28,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:44:28,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:44:28,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:44:28,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:44:28,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:44:28,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:44:28,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:44:28,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:44:28,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:44:28,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:44:28,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:44:28,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:44:28,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:44:28,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:44:28,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:44:28,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:44:28,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:44:28,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:44:28,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:44:28,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:44:28,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:44:28,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:44:28,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:44:28,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:44:28,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:44:28,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:44:28,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:28,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:44:28,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:44:28,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:44:28,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:44:28,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:44:28,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:44:28,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:44:28,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:44:28,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:44:28,402 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 -> a4e6e263a6fe01660f2ecabfa1a654296517a773a2b8a9b458da8809aa3aafd8 [2024-10-10 23:44:28,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:44:28,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:44:28,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:44:28,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:44:28,636 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:44:28,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2024-10-10 23:44:29,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:44:30,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:44:30,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label01.c [2024-10-10 23:44:30,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f376e9dde/5f9e9b282f7f4a7bad0a3f2bb8969e05/FLAGb4fcc9452 [2024-10-10 23:44:30,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f376e9dde/5f9e9b282f7f4a7bad0a3f2bb8969e05 [2024-10-10 23:44:30,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:44:30,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:44:30,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:30,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:44:30,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:44:30,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d73699f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:30, skipping insertion in model container [2024-10-10 23:44:30,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:30" (1/1) ... [2024-10-10 23:44:30,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:44:30,674 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/Problem17_label01.c[6877,6890] [2024-10-10 23:44:31,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:31,020 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:44:31,041 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/Problem17_label01.c[6877,6890] [2024-10-10 23:44:31,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:31,232 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:44:31,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31 WrapperNode [2024-10-10 23:44:31,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:31,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:31,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:44:31,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:44:31,239 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:44:31" (1/1) ... [2024-10-10 23:44:31,267 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:44:31" (1/1) ... [2024-10-10 23:44:31,452 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:44:31,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:31,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:44:31,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:44:31,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:44:31,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,645 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:44:31,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:44:31,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:44:31,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:44:31,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:44:31,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (1/1) ... [2024-10-10 23:44:31,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:31,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:31,849 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:44:31,851 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:44:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:44:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:44:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:44:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:44:31,985 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:44:31,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:44:34,522 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:44:34,523 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:44:34,570 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:44:34,571 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:44:34,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:34 BoogieIcfgContainer [2024-10-10 23:44:34,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:44:34,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:44:34,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:44:34,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:44:34,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:44:30" (1/3) ... [2024-10-10 23:44:34,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17438eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:34, skipping insertion in model container [2024-10-10 23:44:34,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:31" (2/3) ... [2024-10-10 23:44:34,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17438eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:34, skipping insertion in model container [2024-10-10 23:44:34,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:34" (3/3) ... [2024-10-10 23:44:34,580 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label01.c [2024-10-10 23:44:34,592 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:44:34,593 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:44:34,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:44:34,659 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;@2cad805d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:44:34,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:44:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:44:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:44:34,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:34,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:34,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:34,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2000105043, now seen corresponding path program 1 times [2024-10-10 23:44:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727651644] [2024-10-10 23:44:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:34,818 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:44:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727651644] [2024-10-10 23:44:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727651644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:34,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:34,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:34,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226413426] [2024-10-10 23:44:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:44:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:44:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:44:34,842 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:44:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:34,910 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:44:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:44:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-10 23:44:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:34,928 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:44:34,928 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:44:34,933 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:44:34,938 INFO L432 NwaCegarLoop]: 935 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, 935 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:44:34,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:44:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:44:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:44:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:44:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:44:34,998 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 45 [2024-10-10 23:44:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:34,999 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:44:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:44:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:44:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:44:35,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:35,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:35,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:44:35,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:35,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1551850062, now seen corresponding path program 1 times [2024-10-10 23:44:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865103008] [2024-10-10 23:44:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865103008] [2024-10-10 23:44:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865103008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211883880] [2024-10-10 23:44:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:35,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:35,158 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:44:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:37,007 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-10 23:44:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-10 23:44:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:37,010 INFO L225 Difference]: With dead ends: 1501 [2024-10-10 23:44:37,010 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:44:37,011 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:44:37,012 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 426 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:37,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:44:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:44:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:44:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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:44:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:44:37,044 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 45 [2024-10-10 23:44:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:37,044 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:44:37,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:44:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:44:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:44:37,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:37,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:44:37,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:44:37,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:37,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1178648346, now seen corresponding path program 1 times [2024-10-10 23:44:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836254375] [2024-10-10 23:44:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836254375] [2024-10-10 23:44:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836254375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012234191] [2024-10-10 23:44:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:37,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:37,217 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:44:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:39,068 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-10 23:44:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:39,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-10 23:44:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:39,076 INFO L225 Difference]: With dead ends: 2812 [2024-10-10 23:44:39,077 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:44:39,079 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:44:39,081 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:39,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:44:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:44:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-10 23:44:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-10 23:44:39,118 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 112 [2024-10-10 23:44:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:39,120 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-10 23:44:39,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:44:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-10 23:44:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:44:39,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:39,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:44:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:44:39,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 762015358, now seen corresponding path program 1 times [2024-10-10 23:44:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671840003] [2024-10-10 23:44:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671840003] [2024-10-10 23:44:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671840003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952285594] [2024-10-10 23:44:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:39,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:39,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:39,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:44:39,375 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:44:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:41,950 INFO L93 Difference]: Finished difference Result 6764 states and 9257 transitions. [2024-10-10 23:44:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-10 23:44:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:41,962 INFO L225 Difference]: With dead ends: 6764 [2024-10-10 23:44:41,963 INFO L226 Difference]: Without dead ends: 4925 [2024-10-10 23:44:41,966 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:44:41,966 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 866 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:41,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 326 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:44:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2024-10-10 23:44:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4874. [2024-10-10 23:44:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.286476503180792) internal successors, (6269), 4873 states have internal predecessors, (6269), 0 states have call successors, (0), 0 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:44:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6269 transitions. [2024-10-10 23:44:42,020 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6269 transitions. Word has length 115 [2024-10-10 23:44:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:42,020 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6269 transitions. [2024-10-10 23:44:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:44:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6269 transitions. [2024-10-10 23:44:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-10 23:44:42,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:42,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:42,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:44:42,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1942059196, now seen corresponding path program 1 times [2024-10-10 23:44:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671309353] [2024-10-10 23:44:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:44:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671309353] [2024-10-10 23:44:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671309353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778618321] [2024-10-10 23:44:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:42,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:42,219 INFO L87 Difference]: Start difference. First operand 4874 states and 6269 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:44:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:43,562 INFO L93 Difference]: Finished difference Result 14435 states and 18540 transitions. [2024-10-10 23:44:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 186 [2024-10-10 23:44:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:43,580 INFO L225 Difference]: With dead ends: 14435 [2024-10-10 23:44:43,580 INFO L226 Difference]: Without dead ends: 8276 [2024-10-10 23:44:43,586 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:44:43,589 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:43,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 588 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:44:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2024-10-10 23:44:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6146. [2024-10-10 23:44:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6146 states, 6145 states have (on average 1.1907241659886085) internal successors, (7317), 6145 states have internal predecessors, (7317), 0 states have call successors, (0), 0 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:44:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6146 states to 6146 states and 7317 transitions. [2024-10-10 23:44:43,662 INFO L78 Accepts]: Start accepts. Automaton has 6146 states and 7317 transitions. Word has length 186 [2024-10-10 23:44:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:43,663 INFO L471 AbstractCegarLoop]: Abstraction has 6146 states and 7317 transitions. [2024-10-10 23:44:43,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:44:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6146 states and 7317 transitions. [2024-10-10 23:44:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-10 23:44:43,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:43,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:44:43,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1731213872, now seen corresponding path program 1 times [2024-10-10 23:44:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485924047] [2024-10-10 23:44:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:44:43,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485924047] [2024-10-10 23:44:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485924047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:43,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412417728] [2024-10-10 23:44:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:43,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:43,802 INFO L87 Difference]: Start difference. First operand 6146 states and 7317 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:44:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:45,268 INFO L93 Difference]: Finished difference Result 15691 states and 18896 transitions. [2024-10-10 23:44:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 199 [2024-10-10 23:44:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:45,290 INFO L225 Difference]: With dead ends: 15691 [2024-10-10 23:44:45,291 INFO L226 Difference]: Without dead ends: 9546 [2024-10-10 23:44:45,298 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:44:45,299 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 413 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:45,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 475 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:44:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9546 states. [2024-10-10 23:44:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9546 to 6123. [2024-10-10 23:44:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6123 states, 6122 states have (on average 1.1894805619078732) internal successors, (7282), 6122 states have internal predecessors, (7282), 0 states have call successors, (0), 0 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:44:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 7282 transitions. [2024-10-10 23:44:45,379 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 7282 transitions. Word has length 199 [2024-10-10 23:44:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:45,379 INFO L471 AbstractCegarLoop]: Abstraction has 6123 states and 7282 transitions. [2024-10-10 23:44:45,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:44:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 7282 transitions. [2024-10-10 23:44:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 23:44:45,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:45,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:44:45,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1028044277, now seen corresponding path program 1 times [2024-10-10 23:44:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:45,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488098664] [2024-10-10 23:44:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488098664] [2024-10-10 23:44:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488098664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700028247] [2024-10-10 23:44:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:45,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:45,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:45,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:45,518 INFO L87 Difference]: Start difference. First operand 6123 states and 7282 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:44:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:46,805 INFO L93 Difference]: Finished difference Result 16077 states and 19443 transitions. [2024-10-10 23:44:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:46,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-10-10 23:44:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:46,821 INFO L225 Difference]: With dead ends: 16077 [2024-10-10 23:44:46,821 INFO L226 Difference]: Without dead ends: 9955 [2024-10-10 23:44:46,828 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:44:46,828 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 487 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:46,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 785 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:44:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9955 states. [2024-10-10 23:44:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9955 to 9955. [2024-10-10 23:44:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9955 states, 9954 states have (on average 1.1716897729555957) internal successors, (11663), 9954 states have internal predecessors, (11663), 0 states have call successors, (0), 0 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:44:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9955 states to 9955 states and 11663 transitions. [2024-10-10 23:44:46,929 INFO L78 Accepts]: Start accepts. Automaton has 9955 states and 11663 transitions. Word has length 206 [2024-10-10 23:44:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:46,929 INFO L471 AbstractCegarLoop]: Abstraction has 9955 states and 11663 transitions. [2024-10-10 23:44:46,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:44:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 9955 states and 11663 transitions. [2024-10-10 23:44:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 23:44:46,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:46,932 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:46,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:44:46,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -922644452, now seen corresponding path program 1 times [2024-10-10 23:44:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197198197] [2024-10-10 23:44:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:44:47,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197198197] [2024-10-10 23:44:47,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197198197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:44:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029322413] [2024-10-10 23:44:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:44:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:47,218 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:44:47,219 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:44:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:47,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:44:47,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:44:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:44:47,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:44:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:44:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029322413] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:44:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:44:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:44:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146288531] [2024-10-10 23:44:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:47,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:44:47,769 INFO L87 Difference]: Start difference. First operand 9955 states and 11663 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:44:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:50,128 INFO L93 Difference]: Finished difference Result 30574 states and 36166 transitions. [2024-10-10 23:44:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 269 [2024-10-10 23:44:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:50,155 INFO L225 Difference]: With dead ends: 30574 [2024-10-10 23:44:50,155 INFO L226 Difference]: Without dead ends: 19762 [2024-10-10 23:44:50,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:44:50,166 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 889 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:50,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 159 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:44:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2024-10-10 23:44:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 19759. [2024-10-10 23:44:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19759 states, 19758 states have (on average 1.1599858285251543) internal successors, (22919), 19758 states have internal predecessors, (22919), 0 states have call successors, (0), 0 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:44:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19759 states to 19759 states and 22919 transitions. [2024-10-10 23:44:50,422 INFO L78 Accepts]: Start accepts. Automaton has 19759 states and 22919 transitions. Word has length 269 [2024-10-10 23:44:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:50,422 INFO L471 AbstractCegarLoop]: Abstraction has 19759 states and 22919 transitions. [2024-10-10 23:44:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:44:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19759 states and 22919 transitions. [2024-10-10 23:44:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-10 23:44:50,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:50,429 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:50,454 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:44:50,630 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:44:50,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:50,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:50,632 INFO L85 PathProgramCache]: Analyzing trace with hash 514472576, now seen corresponding path program 1 times [2024-10-10 23:44:50,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:50,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177482733] [2024-10-10 23:44:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:44:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177482733] [2024-10-10 23:44:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177482733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:50,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:50,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489441042] [2024-10-10 23:44:50,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:50,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:50,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:50,874 INFO L87 Difference]: Start difference. First operand 19759 states and 22919 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:52,193 INFO L93 Difference]: Finished difference Result 42908 states and 49988 transitions. [2024-10-10 23:44:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2024-10-10 23:44:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:52,228 INFO L225 Difference]: With dead ends: 42908 [2024-10-10 23:44:52,228 INFO L226 Difference]: Without dead ends: 23150 [2024-10-10 23:44:52,244 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:44:52,245 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 374 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:52,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 893 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:44:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23150 states. [2024-10-10 23:44:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23150 to 22724. [2024-10-10 23:44:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22724 states, 22723 states have (on average 1.1456233771949127) internal successors, (26032), 22723 states have internal predecessors, (26032), 0 states have call successors, (0), 0 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:44:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 26032 transitions. [2024-10-10 23:44:52,513 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 26032 transitions. Word has length 282 [2024-10-10 23:44:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 22724 states and 26032 transitions. [2024-10-10 23:44:52,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 26032 transitions. [2024-10-10 23:44:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-10 23:44:52,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:52,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:44:52,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:44:52,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1725216635, now seen corresponding path program 1 times [2024-10-10 23:44:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626102201] [2024-10-10 23:44:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:44:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626102201] [2024-10-10 23:44:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626102201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:44:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134180199] [2024-10-10 23:44:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:44:52,927 INFO L87 Difference]: Start difference. First operand 22724 states and 26032 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:44:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:55,324 INFO L93 Difference]: Finished difference Result 64238 states and 73654 transitions. [2024-10-10 23:44:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:55,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 305 [2024-10-10 23:44:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:55,367 INFO L225 Difference]: With dead ends: 64238 [2024-10-10 23:44:55,367 INFO L226 Difference]: Without dead ends: 38536 [2024-10-10 23:44:55,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:44:55,389 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 873 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:55,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 339 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:44:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38536 states. [2024-10-10 23:44:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38536 to 38055. [2024-10-10 23:44:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38055 states, 38054 states have (on average 1.1408787512482261) internal successors, (43415), 38054 states have internal predecessors, (43415), 0 states have call successors, (0), 0 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:44:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 43415 transitions. [2024-10-10 23:44:55,748 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 43415 transitions. Word has length 305 [2024-10-10 23:44:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:55,748 INFO L471 AbstractCegarLoop]: Abstraction has 38055 states and 43415 transitions. [2024-10-10 23:44:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:44:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 43415 transitions. [2024-10-10 23:44:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-10 23:44:55,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:55,753 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:44:55,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:44:55,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1246574966, now seen corresponding path program 1 times [2024-10-10 23:44:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712222416] [2024-10-10 23:44:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:44:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712222416] [2024-10-10 23:44:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712222416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:55,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045156507] [2024-10-10 23:44:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:55,971 INFO L87 Difference]: Start difference. First operand 38055 states and 43415 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:44:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:57,660 INFO L93 Difference]: Finished difference Result 91843 states and 104583 transitions. [2024-10-10 23:44:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:57,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 317 [2024-10-10 23:44:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:57,722 INFO L225 Difference]: With dead ends: 91843 [2024-10-10 23:44:57,722 INFO L226 Difference]: Without dead ends: 53357 [2024-10-10 23:44:57,751 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:44:57,752 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 423 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:57,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 429 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:44:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53357 states. [2024-10-10 23:44:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53357 to 49523. [2024-10-10 23:44:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49523 states, 49522 states have (on average 1.1243891603731675) internal successors, (55682), 49522 states have internal predecessors, (55682), 0 states have call successors, (0), 0 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:44:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49523 states to 49523 states and 55682 transitions. [2024-10-10 23:44:58,436 INFO L78 Accepts]: Start accepts. Automaton has 49523 states and 55682 transitions. Word has length 317 [2024-10-10 23:44:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 49523 states and 55682 transitions. [2024-10-10 23:44:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:44:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 49523 states and 55682 transitions. [2024-10-10 23:44:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:44:58,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:58,443 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:44:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:44:58,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -588855338, now seen corresponding path program 1 times [2024-10-10 23:44:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696494875] [2024-10-10 23:44:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:44:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696494875] [2024-10-10 23:44:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696494875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:58,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692587356] [2024-10-10 23:44:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:58,727 INFO L87 Difference]: Start difference. First operand 49523 states and 55682 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:45:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:00,326 INFO L93 Difference]: Finished difference Result 114396 states and 129046 transitions. [2024-10-10 23:45:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:00,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 320 [2024-10-10 23:45:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:00,404 INFO L225 Difference]: With dead ends: 114396 [2024-10-10 23:45:00,404 INFO L226 Difference]: Without dead ends: 63172 [2024-10-10 23:45:00,444 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:45:00,444 INFO L432 NwaCegarLoop]: 743 mSDtfsCounter, 364 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:00,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 813 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:45:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63172 states. [2024-10-10 23:45:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63172 to 61885. [2024-10-10 23:45:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61885 states, 61884 states have (on average 1.107410639260552) internal successors, (68531), 61884 states have internal predecessors, (68531), 0 states have call successors, (0), 0 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:45:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61885 states to 61885 states and 68531 transitions. [2024-10-10 23:45:01,076 INFO L78 Accepts]: Start accepts. Automaton has 61885 states and 68531 transitions. Word has length 320 [2024-10-10 23:45:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:01,077 INFO L471 AbstractCegarLoop]: Abstraction has 61885 states and 68531 transitions. [2024-10-10 23:45:01,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:45:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61885 states and 68531 transitions. [2024-10-10 23:45:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-10 23:45:01,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:01,081 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:01,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:45:01,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:01,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1109823014, now seen corresponding path program 1 times [2024-10-10 23:45:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538395919] [2024-10-10 23:45:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 340 proven. 214 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:45:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538395919] [2024-10-10 23:45:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538395919] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088440991] [2024-10-10 23:45:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:01,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:01,507 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:45:01,508 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:45:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:01,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:45:01,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 367 proven. 73 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-10 23:45:01,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-10 23:45:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088440991] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:45:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-10-10 23:45:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838803669] [2024-10-10 23:45:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:45:02,149 INFO L87 Difference]: Start difference. First operand 61885 states and 68531 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:45:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:04,759 INFO L93 Difference]: Finished difference Result 144216 states and 159921 transitions. [2024-10-10 23:45:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:04,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 343 [2024-10-10 23:45:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:04,842 INFO L225 Difference]: With dead ends: 144216 [2024-10-10 23:45:04,842 INFO L226 Difference]: Without dead ends: 82332 [2024-10-10 23:45:04,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:45:04,868 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 908 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:04,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 171 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:45:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82332 states. [2024-10-10 23:45:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82332 to 77652. [2024-10-10 23:45:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77652 states, 77651 states have (on average 1.1105716603778444) internal successors, (86237), 77651 states have internal predecessors, (86237), 0 states have call successors, (0), 0 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:45:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77652 states to 77652 states and 86237 transitions. [2024-10-10 23:45:05,629 INFO L78 Accepts]: Start accepts. Automaton has 77652 states and 86237 transitions. Word has length 343 [2024-10-10 23:45:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 77652 states and 86237 transitions. [2024-10-10 23:45:05,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:45:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 77652 states and 86237 transitions. [2024-10-10 23:45:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-10-10 23:45:05,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:05,634 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2024-10-10 23:45:05,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:45:05,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:05,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:05,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash -468157460, now seen corresponding path program 1 times [2024-10-10 23:45:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145403181] [2024-10-10 23:45:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-10 23:45:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145403181] [2024-10-10 23:45:06,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145403181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:06,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:06,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698141679] [2024-10-10 23:45:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:06,236 INFO L87 Difference]: Start difference. First operand 77652 states and 86237 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:45:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:07,952 INFO L93 Difference]: Finished difference Result 168919 states and 188109 transitions. [2024-10-10 23:45:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:07,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 373 [2024-10-10 23:45:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:08,055 INFO L225 Difference]: With dead ends: 168919 [2024-10-10 23:45:08,055 INFO L226 Difference]: Without dead ends: 90416 [2024-10-10 23:45:08,111 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:45:08,112 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 392 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:08,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 821 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:45:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90416 states. [2024-10-10 23:45:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90416 to 75490. [2024-10-10 23:45:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75490 states, 75489 states have (on average 1.1091947171111023) internal successors, (83732), 75489 states have internal predecessors, (83732), 0 states have call successors, (0), 0 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:45:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75490 states to 75490 states and 83732 transitions. [2024-10-10 23:45:09,129 INFO L78 Accepts]: Start accepts. Automaton has 75490 states and 83732 transitions. Word has length 373 [2024-10-10 23:45:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 75490 states and 83732 transitions. [2024-10-10 23:45:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:45:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 75490 states and 83732 transitions. [2024-10-10 23:45:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:45:09,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:09,134 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:45:09,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:45:09,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:09,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1488693966, now seen corresponding path program 1 times [2024-10-10 23:45:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:09,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512009100] [2024-10-10 23:45:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:45:09,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512009100] [2024-10-10 23:45:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512009100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:09,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893099058] [2024-10-10 23:45:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:09,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:09,269 INFO L87 Difference]: Start difference. First operand 75490 states and 83732 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:45:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:11,179 INFO L93 Difference]: Finished difference Result 156938 states and 174499 transitions. [2024-10-10 23:45:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 378 [2024-10-10 23:45:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:11,263 INFO L225 Difference]: With dead ends: 156938 [2024-10-10 23:45:11,263 INFO L226 Difference]: Without dead ends: 81021 [2024-10-10 23:45:11,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:11,281 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 472 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:11,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 267 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81021 states. [2024-10-10 23:45:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81021 to 78457. [2024-10-10 23:45:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78457 states, 78456 states have (on average 1.1072703171204241) internal successors, (86872), 78456 states have internal predecessors, (86872), 0 states have call successors, (0), 0 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:45:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78457 states to 78457 states and 86872 transitions. [2024-10-10 23:45:12,200 INFO L78 Accepts]: Start accepts. Automaton has 78457 states and 86872 transitions. Word has length 378 [2024-10-10 23:45:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:12,201 INFO L471 AbstractCegarLoop]: Abstraction has 78457 states and 86872 transitions. [2024-10-10 23:45:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:45:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 78457 states and 86872 transitions. [2024-10-10 23:45:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-10 23:45:12,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:12,206 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:12,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:45:12,206 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1292906009, now seen corresponding path program 1 times [2024-10-10 23:45:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222764118] [2024-10-10 23:45:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-10 23:45:12,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222764118] [2024-10-10 23:45:12,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222764118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:12,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:12,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252667949] [2024-10-10 23:45:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:12,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:12,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:12,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:12,343 INFO L87 Difference]: Start difference. First operand 78457 states and 86872 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:45:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:14,043 INFO L93 Difference]: Finished difference Result 167540 states and 185295 transitions. [2024-10-10 23:45:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:14,044 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 395 [2024-10-10 23:45:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:14,145 INFO L225 Difference]: With dead ends: 167540 [2024-10-10 23:45:14,145 INFO L226 Difference]: Without dead ends: 88653 [2024-10-10 23:45:14,200 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:45:14,201 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 391 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:14,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 329 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:45:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88653 states. [2024-10-10 23:45:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88653 to 83122. [2024-10-10 23:45:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83122 states, 83121 states have (on average 1.0984709038630431) internal successors, (91306), 83121 states have internal predecessors, (91306), 0 states have call successors, (0), 0 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:45:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83122 states to 83122 states and 91306 transitions. [2024-10-10 23:45:15,321 INFO L78 Accepts]: Start accepts. Automaton has 83122 states and 91306 transitions. Word has length 395 [2024-10-10 23:45:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 83122 states and 91306 transitions. [2024-10-10 23:45:15,322 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:45:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 83122 states and 91306 transitions. [2024-10-10 23:45:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:45:15,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:15,327 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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:45:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:45:15,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -821633864, now seen corresponding path program 1 times [2024-10-10 23:45:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845543204] [2024-10-10 23:45:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 346 proven. 44 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:45:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845543204] [2024-10-10 23:45:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845543204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095939021] [2024-10-10 23:45:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:15,920 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:45:15,920 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:45:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:16,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:45:16,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-10 23:45:16,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 417 proven. 82 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-10 23:45:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095939021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:45:17,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:45:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:45:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125060850] [2024-10-10 23:45:17,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:45:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:45:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:45:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:45:17,250 INFO L87 Difference]: Start difference. First operand 83122 states and 91306 transitions. Second operand has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 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:45:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:27,716 INFO L93 Difference]: Finished difference Result 205833 states and 225121 transitions. [2024-10-10 23:45:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-10 23:45:27,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 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 425 [2024-10-10 23:45:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:27,843 INFO L225 Difference]: With dead ends: 205833 [2024-10-10 23:45:27,844 INFO L226 Difference]: Without dead ends: 117604 [2024-10-10 23:45:27,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-10-10 23:45:27,881 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 10219 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 15094 mSolverCounterSat, 2742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10219 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 17836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2742 IncrementalHoareTripleChecker+Valid, 15094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:27,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10219 Valid, 472 Invalid, 17836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2742 Valid, 15094 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-10-10 23:45:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117604 states. [2024-10-10 23:45:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117604 to 97562. [2024-10-10 23:45:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97562 states, 97561 states have (on average 1.08021647994588) internal successors, (105387), 97561 states have internal predecessors, (105387), 0 states have call successors, (0), 0 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:45:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97562 states to 97562 states and 105387 transitions. [2024-10-10 23:45:29,031 INFO L78 Accepts]: Start accepts. Automaton has 97562 states and 105387 transitions. Word has length 425 [2024-10-10 23:45:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:29,032 INFO L471 AbstractCegarLoop]: Abstraction has 97562 states and 105387 transitions. [2024-10-10 23:45:29,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.0) internal successors, (738), 9 states have internal predecessors, (738), 0 states have call successors, (0), 0 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:45:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 97562 states and 105387 transitions. [2024-10-10 23:45:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-10-10 23:45:29,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:29,038 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:45:29,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:45:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:29,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2061043902, now seen corresponding path program 1 times [2024-10-10 23:45:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667475322] [2024-10-10 23:45:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667475322] [2024-10-10 23:45:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667475322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808570059] [2024-10-10 23:45:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:29,808 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:45:29,809 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:45:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:29,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:45:29,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:30,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 251 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808570059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:45:31,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:45:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-10 23:45:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181585810] [2024-10-10 23:45:31,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:45:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 23:45:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:31,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 23:45:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:45:31,941 INFO L87 Difference]: Start difference. First operand 97562 states and 105387 transitions. Second operand has 8 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:45:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:37,152 INFO L93 Difference]: Finished difference Result 232204 states and 249487 transitions. [2024-10-10 23:45:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 23:45:37,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 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 503 [2024-10-10 23:45:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:37,294 INFO L225 Difference]: With dead ends: 232204 [2024-10-10 23:45:37,294 INFO L226 Difference]: Without dead ends: 133368 [2024-10-10 23:45:37,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:45:37,354 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 2126 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7338 mSolverCounterSat, 1445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 8783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1445 IncrementalHoareTripleChecker+Valid, 7338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:37,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 304 Invalid, 8783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1445 Valid, 7338 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-10 23:45:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133368 states. [2024-10-10 23:45:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133368 to 108186. [2024-10-10 23:45:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108186 states, 108185 states have (on average 1.0669778619956556) internal successors, (115431), 108185 states have internal predecessors, (115431), 0 states have call successors, (0), 0 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:45:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108186 states to 108186 states and 115431 transitions. [2024-10-10 23:45:38,800 INFO L78 Accepts]: Start accepts. Automaton has 108186 states and 115431 transitions. Word has length 503 [2024-10-10 23:45:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:38,800 INFO L471 AbstractCegarLoop]: Abstraction has 108186 states and 115431 transitions. [2024-10-10 23:45:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:45:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 108186 states and 115431 transitions. [2024-10-10 23:45:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2024-10-10 23:45:38,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:38,811 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:38,824 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:45:39,011 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,SelfDestructingSolverStorable17 [2024-10-10 23:45:39,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:39,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1443946345, now seen corresponding path program 1 times [2024-10-10 23:45:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500475841] [2024-10-10 23:45:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500475841] [2024-10-10 23:45:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500475841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513303513] [2024-10-10 23:45:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:39,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:39,393 INFO L87 Difference]: Start difference. First operand 108186 states and 115431 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:45:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:40,907 INFO L93 Difference]: Finished difference Result 215940 states and 230165 transitions. [2024-10-10 23:45:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:40,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 514 [2024-10-10 23:45:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:41,023 INFO L225 Difference]: With dead ends: 215940 [2024-10-10 23:45:41,023 INFO L226 Difference]: Without dead ends: 107755 [2024-10-10 23:45:41,081 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:45:41,082 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 402 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:41,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 661 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:45:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107755 states. [2024-10-10 23:45:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107755 to 103501. [2024-10-10 23:45:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103501 states, 103500 states have (on average 1.0625700483091787) internal successors, (109976), 103500 states have internal predecessors, (109976), 0 states have call successors, (0), 0 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:45:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103501 states to 103501 states and 109976 transitions. [2024-10-10 23:45:43,210 INFO L78 Accepts]: Start accepts. Automaton has 103501 states and 109976 transitions. Word has length 514 [2024-10-10 23:45:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 103501 states and 109976 transitions. [2024-10-10 23:45:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:45:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 103501 states and 109976 transitions. [2024-10-10 23:45:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-10-10 23:45:43,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:43,218 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:45:43,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1136106381, now seen corresponding path program 1 times [2024-10-10 23:45:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204526449] [2024-10-10 23:45:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:43,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204526449] [2024-10-10 23:45:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204526449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251067077] [2024-10-10 23:45:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:43,673 INFO L87 Difference]: Start difference. First operand 103501 states and 109976 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:45:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:45,302 INFO L93 Difference]: Finished difference Result 212550 states and 225869 transitions. [2024-10-10 23:45:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:45,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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 541 [2024-10-10 23:45:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:45,435 INFO L225 Difference]: With dead ends: 212550 [2024-10-10 23:45:45,436 INFO L226 Difference]: Without dead ends: 108624 [2024-10-10 23:45:45,450 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:45:45,452 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 395 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:45,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 201 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:45:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108624 states. [2024-10-10 23:45:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108624 to 106485. [2024-10-10 23:45:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106485 states, 106484 states have (on average 1.0599620600277977) internal successors, (112869), 106484 states have internal predecessors, (112869), 0 states have call successors, (0), 0 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:45:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106485 states to 106485 states and 112869 transitions. [2024-10-10 23:45:46,768 INFO L78 Accepts]: Start accepts. Automaton has 106485 states and 112869 transitions. Word has length 541 [2024-10-10 23:45:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 106485 states and 112869 transitions. [2024-10-10 23:45:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:45:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 106485 states and 112869 transitions. [2024-10-10 23:45:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2024-10-10 23:45:46,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:46,779 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:46,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:45:46,779 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:46,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1836522856, now seen corresponding path program 1 times [2024-10-10 23:45:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804278259] [2024-10-10 23:45:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-10-10 23:45:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804278259] [2024-10-10 23:45:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804278259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:47,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:47,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:45:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759436942] [2024-10-10 23:45:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:47,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:47,313 INFO L87 Difference]: Start difference. First operand 106485 states and 112869 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:45:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:48,234 INFO L93 Difference]: Finished difference Result 204448 states and 216605 transitions. [2024-10-10 23:45:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 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 549 [2024-10-10 23:45:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:48,331 INFO L225 Difference]: With dead ends: 204448 [2024-10-10 23:45:48,331 INFO L226 Difference]: Without dead ends: 97964 [2024-10-10 23:45:48,390 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:45:48,391 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 579 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:48,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 73 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:45:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97964 states. [2024-10-10 23:45:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97964 to 94977. [2024-10-10 23:45:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94977 states, 94976 states have (on average 1.0600151617250675) internal successors, (100676), 94976 states have internal predecessors, (100676), 0 states have call successors, (0), 0 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:45:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94977 states to 94977 states and 100676 transitions. [2024-10-10 23:45:49,725 INFO L78 Accepts]: Start accepts. Automaton has 94977 states and 100676 transitions. Word has length 549 [2024-10-10 23:45:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:49,725 INFO L471 AbstractCegarLoop]: Abstraction has 94977 states and 100676 transitions. [2024-10-10 23:45:49,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:45:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 94977 states and 100676 transitions. [2024-10-10 23:45:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-10-10 23:45:49,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:49,735 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:49,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:45:49,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2124458294, now seen corresponding path program 1 times [2024-10-10 23:45:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793362382] [2024-10-10 23:45:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:45:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793362382] [2024-10-10 23:45:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793362382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:45:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931524912] [2024-10-10 23:45:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:45:50,016 INFO L87 Difference]: Start difference. First operand 94977 states and 100676 transitions. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 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:45:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:52,321 INFO L93 Difference]: Finished difference Result 214219 states and 226887 transitions. [2024-10-10 23:45:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 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 585 [2024-10-10 23:45:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:52,449 INFO L225 Difference]: With dead ends: 214219 [2024-10-10 23:45:52,450 INFO L226 Difference]: Without dead ends: 119243 [2024-10-10 23:45:52,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:45:52,505 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 723 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:52,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 181 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:45:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119243 states.