./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:31:03,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:31:04,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:31:04,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:31:04,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:31:04,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:31:04,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:31:04,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:31:04,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:31:04,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:31:04,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:31:04,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:31:04,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:31:04,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:31:04,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:31:04,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:31:04,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:31:04,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:31:04,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:31:04,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:31:04,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:31:04,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:31:04,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:31:04,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:31:04,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:31:04,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:31:04,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:31:04,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:31:04,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:31:04,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:31:04,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:31:04,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:31:04,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:31:04,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:31:04,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:31:04,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:31:04,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:31:04,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:31:04,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:31:04,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:31:04,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:31:04,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:31:04,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2024-11-18 10:31:04,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:31:04,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:31:04,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:31:04,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:31:04,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:31:04,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-11-18 10:31:05,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:31:06,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:31:06,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-11-18 10:31:06,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78062dafc/eb7daa9cb5e445eda3ed5d58023b6d66/FLAGfa128ba8d [2024-11-18 10:31:06,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78062dafc/eb7daa9cb5e445eda3ed5d58023b6d66 [2024-11-18 10:31:06,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:31:06,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:31:06,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:31:06,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:31:06,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:31:06,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:06" (1/1) ... [2024-11-18 10:31:06,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5fdefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:06, skipping insertion in model container [2024-11-18 10:31:06,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:31:06" (1/1) ... [2024-11-18 10:31:06,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:31:06,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c[5297,5310] [2024-11-18 10:31:07,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:31:07,671 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:31:07,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c[5297,5310] [2024-11-18 10:31:08,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:31:08,169 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:31:08,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08 WrapperNode [2024-11-18 10:31:08,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:31:08,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:31:08,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:31:08,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:31:08,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:08,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:08,853 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-18 10:31:08,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:31:08,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:31:08,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:31:08,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:31:08,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:08,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,241 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 10:31:09,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:31:09,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:31:09,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:31:09,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:31:09,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (1/1) ... [2024-11-18 10:31:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:31:09,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:31:09,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 10:31:09,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 10:31:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:31:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:31:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:31:09,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:31:09,717 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:31:09,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:31:15,710 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-18 10:31:15,710 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:31:15,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:31:15,750 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:31:15,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:15 BoogieIcfgContainer [2024-11-18 10:31:15,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:31:15,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:31:15,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:31:15,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:31:15,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:31:06" (1/3) ... [2024-11-18 10:31:15,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1aca3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:15, skipping insertion in model container [2024-11-18 10:31:15,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:31:08" (2/3) ... [2024-11-18 10:31:15,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1aca3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:31:15, skipping insertion in model container [2024-11-18 10:31:15,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:31:15" (3/3) ... [2024-11-18 10:31:15,759 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2024-11-18 10:31:15,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:31:15,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:31:15,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:31:15,879 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;@6668e38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:31:15,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:31:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 10:31:15,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:15,895 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] [2024-11-18 10:31:15,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2024-11-18 10:31:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373738599] [2024-11-18 10:31:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373738599] [2024-11-18 10:31:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373738599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601511223] [2024-11-18 10:31:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:16,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:16,355 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:21,060 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-18 10:31:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-18 10:31:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:21,087 INFO L225 Difference]: With dead ends: 3160 [2024-11-18 10:31:21,087 INFO L226 Difference]: Without dead ends: 1983 [2024-11-18 10:31:21,093 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-11-18 10:31:21,097 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1067 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:21,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-18 10:31:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-18 10:31:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-18 10:31:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-18 10:31:21,221 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 36 [2024-11-18 10:31:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:21,221 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-18 10:31:21,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-18 10:31:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-18 10:31:21,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:21,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:21,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:31:21,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash -853326582, now seen corresponding path program 1 times [2024-11-18 10:31:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320099406] [2024-11-18 10:31:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320099406] [2024-11-18 10:31:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320099406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448349317] [2024-11-18 10:31:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:21,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:21,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:21,554 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:29,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 10:31:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:29,347 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-18 10:31:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-18 10:31:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:29,364 INFO L225 Difference]: With dead ends: 5456 [2024-11-18 10:31:29,364 INFO L226 Difference]: Without dead ends: 3528 [2024-11-18 10:31:29,369 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-11-18 10:31:29,370 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 878 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:29,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1008 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2308 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2024-11-18 10:31:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-18 10:31:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-18 10:31:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-18 10:31:29,444 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 101 [2024-11-18 10:31:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:29,445 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-18 10:31:29,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-18 10:31:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-18 10:31:29,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:29,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:31:29,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -97090789, now seen corresponding path program 1 times [2024-11-18 10:31:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367559656] [2024-11-18 10:31:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367559656] [2024-11-18 10:31:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367559656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:29,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353772352] [2024-11-18 10:31:29,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:29,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:29,633 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:32,956 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2024-11-18 10:31:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-18 10:31:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:32,981 INFO L225 Difference]: With dead ends: 10232 [2024-11-18 10:31:32,981 INFO L226 Difference]: Without dead ends: 6708 [2024-11-18 10:31:32,988 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-11-18 10:31:32,989 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:32,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 850 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-18 10:31:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2024-11-18 10:31:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2024-11-18 10:31:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-18 10:31:33,112 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 107 [2024-11-18 10:31:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:33,113 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-18 10:31:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-18 10:31:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-18 10:31:33,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:33,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:33,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:31:33,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -456177296, now seen corresponding path program 1 times [2024-11-18 10:31:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524662852] [2024-11-18 10:31:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:33,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524662852] [2024-11-18 10:31:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524662852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826757360] [2024-11-18 10:31:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:33,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:33,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:33,315 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:36,834 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-18 10:31:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-18 10:31:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:36,871 INFO L225 Difference]: With dead ends: 17443 [2024-11-18 10:31:36,872 INFO L226 Difference]: Without dead ends: 10745 [2024-11-18 10:31:36,881 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-11-18 10:31:36,884 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:36,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-18 10:31:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-18 10:31:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-18 10:31:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-18 10:31:37,119 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 137 [2024-11-18 10:31:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:37,121 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-18 10:31:37,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-18 10:31:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-18 10:31:37,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:37,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:37,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:31:37,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2032460361, now seen corresponding path program 1 times [2024-11-18 10:31:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596875393] [2024-11-18 10:31:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596875393] [2024-11-18 10:31:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596875393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931723167] [2024-11-18 10:31:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:37,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:37,605 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:40,483 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-18 10:31:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-18 10:31:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:40,512 INFO L225 Difference]: With dead ends: 20549 [2024-11-18 10:31:40,513 INFO L226 Difference]: Without dead ends: 10669 [2024-11-18 10:31:40,525 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-11-18 10:31:40,526 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:40,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 10:31:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-18 10:31:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-18 10:31:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-18 10:31:40,724 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 147 [2024-11-18 10:31:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:40,725 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-18 10:31:40,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-18 10:31:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-18 10:31:40,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:40,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:40,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:31:40,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 475465869, now seen corresponding path program 1 times [2024-11-18 10:31:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758778232] [2024-11-18 10:31:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:41,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758778232] [2024-11-18 10:31:41,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758778232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:31:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205568395] [2024-11-18 10:31:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:31:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:31:41,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:31:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 10:31:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:41,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:31:41,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:31:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 10:31:41,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:31:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205568395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:41,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:31:41,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 10:31:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940335334] [2024-11-18 10:31:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:31:41,797 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:44,975 INFO L93 Difference]: Finished difference Result 30031 states and 41217 transitions. [2024-11-18 10:31:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 161 [2024-11-18 10:31:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:45,017 INFO L225 Difference]: With dead ends: 30031 [2024-11-18 10:31:45,018 INFO L226 Difference]: Without dead ends: 20151 [2024-11-18 10:31:45,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:31:45,035 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 736 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:45,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1221 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-18 10:31:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2024-11-18 10:31:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 19337. [2024-11-18 10:31:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19337 states, 19336 states have (on average 1.24244931733554) internal successors, (24024), 19336 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19337 states to 19337 states and 24024 transitions. [2024-11-18 10:31:45,314 INFO L78 Accepts]: Start accepts. Automaton has 19337 states and 24024 transitions. Word has length 161 [2024-11-18 10:31:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:45,315 INFO L471 AbstractCegarLoop]: Abstraction has 19337 states and 24024 transitions. [2024-11-18 10:31:45,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19337 states and 24024 transitions. [2024-11-18 10:31:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-18 10:31:45,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:45,319 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:31:45,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 10:31:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 10:31:45,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 106432199, now seen corresponding path program 1 times [2024-11-18 10:31:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088894140] [2024-11-18 10:31:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-18 10:31:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088894140] [2024-11-18 10:31:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088894140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:31:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531325916] [2024-11-18 10:31:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:45,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:45,889 INFO L87 Difference]: Start difference. First operand 19337 states and 24024 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:49,084 INFO L93 Difference]: Finished difference Result 44989 states and 55628 transitions. [2024-11-18 10:31:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:49,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 248 [2024-11-18 10:31:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:49,131 INFO L225 Difference]: With dead ends: 44989 [2024-11-18 10:31:49,131 INFO L226 Difference]: Without dead ends: 26441 [2024-11-18 10:31:49,150 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-11-18 10:31:49,151 INFO L432 NwaCegarLoop]: 1029 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:49,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1213 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-18 10:31:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26441 states. [2024-11-18 10:31:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26441 to 26434. [2024-11-18 10:31:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26434 states, 26433 states have (on average 1.200582605076987) internal successors, (31735), 26433 states have internal predecessors, (31735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26434 states to 26434 states and 31735 transitions. [2024-11-18 10:31:49,522 INFO L78 Accepts]: Start accepts. Automaton has 26434 states and 31735 transitions. Word has length 248 [2024-11-18 10:31:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:49,524 INFO L471 AbstractCegarLoop]: Abstraction has 26434 states and 31735 transitions. [2024-11-18 10:31:49,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26434 states and 31735 transitions. [2024-11-18 10:31:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-18 10:31:49,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:49,529 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:31:49,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:31:49,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:49,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1619127421, now seen corresponding path program 1 times [2024-11-18 10:31:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391055086] [2024-11-18 10:31:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:49,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391055086] [2024-11-18 10:31:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391055086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:31:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076807008] [2024-11-18 10:31:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:49,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:49,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:49,682 INFO L87 Difference]: Start difference. First operand 26434 states and 31735 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:53,483 INFO L93 Difference]: Finished difference Result 72535 states and 87971 transitions. [2024-11-18 10:31:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-11-18 10:31:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:53,545 INFO L225 Difference]: With dead ends: 72535 [2024-11-18 10:31:53,545 INFO L226 Difference]: Without dead ends: 46103 [2024-11-18 10:31:53,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:53,572 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 841 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:53,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1984 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-18 10:31:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46103 states. [2024-11-18 10:31:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46103 to 43733. [2024-11-18 10:31:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43733 states, 43732 states have (on average 1.1691210097868838) internal successors, (51128), 43732 states have internal predecessors, (51128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43733 states to 43733 states and 51128 transitions. [2024-11-18 10:31:54,272 INFO L78 Accepts]: Start accepts. Automaton has 43733 states and 51128 transitions. Word has length 250 [2024-11-18 10:31:54,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:54,273 INFO L471 AbstractCegarLoop]: Abstraction has 43733 states and 51128 transitions. [2024-11-18 10:31:54,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43733 states and 51128 transitions. [2024-11-18 10:31:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-18 10:31:54,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:54,278 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:31:54,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:31:54,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2125069961, now seen corresponding path program 1 times [2024-11-18 10:31:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:54,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710362326] [2024-11-18 10:31:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:31:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:31:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:31:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710362326] [2024-11-18 10:31:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710362326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:31:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:31:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:31:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31201294] [2024-11-18 10:31:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:31:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:31:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:31:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:31:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:54,482 INFO L87 Difference]: Start difference. First operand 43733 states and 51128 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:31:58,349 INFO L93 Difference]: Finished difference Result 106364 states and 126458 transitions. [2024-11-18 10:31:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:31:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-11-18 10:31:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:31:58,452 INFO L225 Difference]: With dead ends: 106364 [2024-11-18 10:31:58,452 INFO L226 Difference]: Without dead ends: 63420 [2024-11-18 10:31:58,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:31:58,492 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 823 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:31:58,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 930 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-18 10:31:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63420 states. [2024-11-18 10:31:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63420 to 61048. [2024-11-18 10:31:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61048 states, 61047 states have (on average 1.1609579504316347) internal successors, (70873), 61047 states have internal predecessors, (70873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61048 states to 61048 states and 70873 transitions. [2024-11-18 10:31:59,631 INFO L78 Accepts]: Start accepts. Automaton has 61048 states and 70873 transitions. Word has length 263 [2024-11-18 10:31:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:31:59,631 INFO L471 AbstractCegarLoop]: Abstraction has 61048 states and 70873 transitions. [2024-11-18 10:31:59,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:31:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 61048 states and 70873 transitions. [2024-11-18 10:31:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-18 10:31:59,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:31:59,638 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:31:59,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:31:59,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:31:59,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:31:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash 405212956, now seen corresponding path program 1 times [2024-11-18 10:31:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:31:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822235597] [2024-11-18 10:31:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:31:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:31:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:32:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-18 10:32:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:32:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822235597] [2024-11-18 10:32:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822235597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:32:00,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:32:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:32:00,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190637728] [2024-11-18 10:32:00,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:32:00,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:32:00,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:32:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:32:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:32:00,096 INFO L87 Difference]: Start difference. First operand 61048 states and 70873 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:32:06,734 INFO L93 Difference]: Finished difference Result 160082 states and 186750 transitions. [2024-11-18 10:32:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:32:06,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 324 [2024-11-18 10:32:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:32:06,855 INFO L225 Difference]: With dead ends: 160082 [2024-11-18 10:32:06,855 INFO L226 Difference]: Without dead ends: 99823 [2024-11-18 10:32:06,883 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-11-18 10:32:06,884 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 1689 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7042 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 7042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:32:06,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1113 Invalid, 7981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 7042 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-18 10:32:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99823 states. [2024-11-18 10:32:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99823 to 76803. [2024-11-18 10:32:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76803 states, 76802 states have (on average 1.1463763964480091) internal successors, (88044), 76802 states have internal predecessors, (88044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76803 states to 76803 states and 88044 transitions. [2024-11-18 10:32:08,211 INFO L78 Accepts]: Start accepts. Automaton has 76803 states and 88044 transitions. Word has length 324 [2024-11-18 10:32:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:32:08,212 INFO L471 AbstractCegarLoop]: Abstraction has 76803 states and 88044 transitions. [2024-11-18 10:32:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 76803 states and 88044 transitions. [2024-11-18 10:32:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-18 10:32:08,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:32:08,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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:32:08,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:32:08,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:32:08,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:32:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -269962597, now seen corresponding path program 1 times [2024-11-18 10:32:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:32:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196053632] [2024-11-18 10:32:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:32:08,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:32:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:32:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-18 10:32:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:32:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196053632] [2024-11-18 10:32:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196053632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:32:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142025896] [2024-11-18 10:32:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:32:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:32:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:32:09,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:32:09,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 10:32:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:32:09,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:32:09,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:32:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-18 10:32:10,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:32:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142025896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:32:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:32:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-18 10:32:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755694617] [2024-11-18 10:32:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:32:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:32:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:32:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:32:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-18 10:32:10,101 INFO L87 Difference]: Start difference. First operand 76803 states and 88044 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:32:13,210 INFO L93 Difference]: Finished difference Result 152806 states and 175284 transitions. [2024-11-18 10:32:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:32:13,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 342 [2024-11-18 10:32:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:32:13,297 INFO L225 Difference]: With dead ends: 152806 [2024-11-18 10:32:13,298 INFO L226 Difference]: Without dead ends: 76792 [2024-11-18 10:32:13,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-18 10:32:13,333 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 1073 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:32:13,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 814 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-18 10:32:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76792 states. [2024-11-18 10:32:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76792 to 76789. [2024-11-18 10:32:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76789 states, 76788 states have (on average 1.1087149033703183) internal successors, (85136), 76788 states have internal predecessors, (85136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76789 states to 76789 states and 85136 transitions. [2024-11-18 10:32:14,414 INFO L78 Accepts]: Start accepts. Automaton has 76789 states and 85136 transitions. Word has length 342 [2024-11-18 10:32:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:32:14,414 INFO L471 AbstractCegarLoop]: Abstraction has 76789 states and 85136 transitions. [2024-11-18 10:32:14,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76789 states and 85136 transitions. [2024-11-18 10:32:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-18 10:32:14,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:32:14,421 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:32:14,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 10:32:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 10:32:14,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:32:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:32:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1322459551, now seen corresponding path program 1 times [2024-11-18 10:32:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:32:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252779961] [2024-11-18 10:32:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:32:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:32:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:32:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 293 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-18 10:32:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:32:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252779961] [2024-11-18 10:32:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252779961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:32:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558429725] [2024-11-18 10:32:16,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:32:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:32:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:32:16,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:32:16,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 10:32:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:32:16,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:32:16,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:32:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-18 10:32:16,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:32:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558429725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:32:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:32:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-18 10:32:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878029823] [2024-11-18 10:32:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:32:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:32:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:32:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:32:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:32:16,335 INFO L87 Difference]: Start difference. First operand 76789 states and 85136 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:32:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:32:19,689 INFO L93 Difference]: Finished difference Result 152787 states and 169477 transitions. [2024-11-18 10:32:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:32:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 391 [2024-11-18 10:32:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:32:19,777 INFO L225 Difference]: With dead ends: 152787 [2024-11-18 10:32:19,777 INFO L226 Difference]: Without dead ends: 76787 [2024-11-18 10:32:19,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:32:19,931 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:32:19,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1422 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-18 10:32:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76787 states. [2024-11-18 10:32:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76787 to 76786.