./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label49.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 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:31:43,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:31:43,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:31:43,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:31:43,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:31:43,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:31:43,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:31:43,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:31:43,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:31:43,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:31:43,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:31:43,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:31:43,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:31:43,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:31:43,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:31:43,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:31:43,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:31:43,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:31:43,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:31:43,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:31:43,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:31:43,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:31:43,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:31:43,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:31:43,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:31:43,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:31:43,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:31:43,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:31:43,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:31:43,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:31:43,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:31:43,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:31:43,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:31:43,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:31:43,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:31:43,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:31:43,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:31:43,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:31:43,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:31:43,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:31:43,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:31:43,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:31:43,172 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 -> 6eed2c2d5e428bcec2beb9a0ebe7c478639dba36839dc4adf5520912920088de [2024-11-08 11:31:43,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:31:43,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:31:43,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:31:43,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:31:43,446 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:31:43,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2024-11-08 11:31:44,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:31:45,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:31:45,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label49.c [2024-11-08 11:31:45,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed0ec78e/e875c0f898c046709a1c0e34aa51daca/FLAG9fa78185b [2024-11-08 11:31:45,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed0ec78e/e875c0f898c046709a1c0e34aa51daca [2024-11-08 11:31:45,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:31:45,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:31:45,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:31:45,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:31:45,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:31:45,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:45" (1/1) ... [2024-11-08 11:31:45,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc0aa47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:45, skipping insertion in model container [2024-11-08 11:31:45,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:31:45" (1/1) ... [2024-11-08 11:31:45,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:31:45,656 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/Problem15_label49.c[6430,6443] [2024-11-08 11:31:46,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:31:46,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:31:46,058 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/Problem15_label49.c[6430,6443] [2024-11-08 11:31:46,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:31:46,309 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:31:46,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46 WrapperNode [2024-11-08 11:31:46,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:31:46,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:31:46,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:31:46,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:31:46,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,495 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-08 11:31:46,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:31:46,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:31:46,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:31:46,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:31:46,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,655 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:31:46,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:31:46,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:31:46,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:31:46,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:31:46,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (1/1) ... [2024-11-08 11:31:46,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:31:46,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:31:46,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:31:46,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:31:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:31:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:31:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:31:46,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:31:47,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:31:47,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:31:49,320 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-08 11:31:49,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:31:49,351 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:31:49,355 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:31:49,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:49 BoogieIcfgContainer [2024-11-08 11:31:49,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:31:49,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:31:49,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:31:49,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:31:49,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:31:45" (1/3) ... [2024-11-08 11:31:49,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ecefa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:31:49, skipping insertion in model container [2024-11-08 11:31:49,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:31:46" (2/3) ... [2024-11-08 11:31:49,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ecefa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:31:49, skipping insertion in model container [2024-11-08 11:31:49,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:49" (3/3) ... [2024-11-08 11:31:49,366 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2024-11-08 11:31:49,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:31:49,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:31:49,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:31:49,500 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;@24dd3da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:31:49,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:31:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 11:31:49,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:49,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:49,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:49,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2024-11-08 11:31:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:49,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136735460] [2024-11-08 11:31:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:31:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136735460] [2024-11-08 11:31:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136735460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:49,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:31:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716251038] [2024-11-08 11:31:49,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:49,971 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:52,676 INFO L93 Difference]: Finished difference Result 1191 states and 2157 transitions. [2024-11-08 11:31:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-08 11:31:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:52,699 INFO L225 Difference]: With dead ends: 1191 [2024-11-08 11:31:52,701 INFO L226 Difference]: Without dead ends: 688 [2024-11-08 11:31:52,706 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-08 11:31:52,710 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 319 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:52,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:31:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-08 11:31:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2024-11-08 11:31:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2024-11-08 11:31:52,800 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 52 [2024-11-08 11:31:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:52,801 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2024-11-08 11:31:52,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2024-11-08 11:31:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 11:31:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:52,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:31:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:31:52,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1878954897, now seen corresponding path program 1 times [2024-11-08 11:31:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927478678] [2024-11-08 11:31:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:31:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927478678] [2024-11-08 11:31:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927478678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:31:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963101260] [2024-11-08 11:31:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:53,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:53,025 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:54,312 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2024-11-08 11:31:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-08 11:31:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:54,318 INFO L225 Difference]: With dead ends: 1964 [2024-11-08 11:31:54,318 INFO L226 Difference]: Without dead ends: 1286 [2024-11-08 11:31:54,320 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-08 11:31:54,321 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:54,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:31:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-08 11:31:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2024-11-08 11:31:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2024-11-08 11:31:54,357 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 120 [2024-11-08 11:31:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:54,358 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2024-11-08 11:31:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2024-11-08 11:31:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:31:54,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:54,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:31:54,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:31:54,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:54,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1194964867, now seen corresponding path program 1 times [2024-11-08 11:31:54,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808243676] [2024-11-08 11:31:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:31:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:54,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808243676] [2024-11-08 11:31:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808243676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:31:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237795384] [2024-11-08 11:31:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:54,592 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:56,075 INFO L93 Difference]: Finished difference Result 3766 states and 5246 transitions. [2024-11-08 11:31:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:56,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-08 11:31:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:56,088 INFO L225 Difference]: With dead ends: 3766 [2024-11-08 11:31:56,088 INFO L226 Difference]: Without dead ends: 2487 [2024-11-08 11:31:56,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:56,094 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 276 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:56,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:31:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-08 11:31:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2487. [2024-11-08 11:31:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.244569589702333) internal successors, (3094), 2486 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3094 transitions. [2024-11-08 11:31:56,143 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3094 transitions. Word has length 128 [2024-11-08 11:31:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3094 transitions. [2024-11-08 11:31:56,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3094 transitions. [2024-11-08 11:31:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 11:31:56,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:56,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:31:56,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:31:56,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:56,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1487686959, now seen corresponding path program 1 times [2024-11-08 11:31:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503735202] [2024-11-08 11:31:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:31:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503735202] [2024-11-08 11:31:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503735202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:56,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:56,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:31:56,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053937822] [2024-11-08 11:31:56,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:56,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:56,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:56,357 INFO L87 Difference]: Start difference. First operand 2487 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:57,611 INFO L93 Difference]: Finished difference Result 6173 states and 7859 transitions. [2024-11-08 11:31:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-08 11:31:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:57,624 INFO L225 Difference]: With dead ends: 6173 [2024-11-08 11:31:57,624 INFO L226 Difference]: Without dead ends: 3688 [2024-11-08 11:31:57,629 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-08 11:31:57,631 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 233 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:57,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:31:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2024-11-08 11:31:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3387. [2024-11-08 11:31:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.2114589486119314) internal successors, (4102), 3386 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4102 transitions. [2024-11-08 11:31:57,695 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4102 transitions. Word has length 134 [2024-11-08 11:31:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4102 transitions. [2024-11-08 11:31:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4102 transitions. [2024-11-08 11:31:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 11:31:57,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:57,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:31:57,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:57,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 649952050, now seen corresponding path program 1 times [2024-11-08 11:31:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621945301] [2024-11-08 11:31:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:31:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 11:31:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:31:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621945301] [2024-11-08 11:31:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621945301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:31:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:31:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:31:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384931600] [2024-11-08 11:31:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:31:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:31:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:31:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:31:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:31:58,068 INFO L87 Difference]: Start difference. First operand 3387 states and 4102 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:31:59,501 INFO L93 Difference]: Finished difference Result 9172 states and 11160 transitions. [2024-11-08 11:31:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:31:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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-08 11:31:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:31:59,519 INFO L225 Difference]: With dead ends: 9172 [2024-11-08 11:31:59,520 INFO L226 Difference]: Without dead ends: 5787 [2024-11-08 11:31:59,524 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-08 11:31:59,525 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:31:59,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:31:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2024-11-08 11:31:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5186. [2024-11-08 11:31:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5185 states have (on average 1.1778206364513018) internal successors, (6107), 5185 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 6107 transitions. [2024-11-08 11:31:59,610 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 6107 transitions. Word has length 248 [2024-11-08 11:31:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:31:59,611 INFO L471 AbstractCegarLoop]: Abstraction has 5186 states and 6107 transitions. [2024-11-08 11:31:59,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:31:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 6107 transitions. [2024-11-08 11:31:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-08 11:31:59,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:31:59,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:31:59,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:31:59,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:31:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:31:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1477243746, now seen corresponding path program 1 times [2024-11-08 11:31:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:31:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516898731] [2024-11-08 11:31:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:31:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:31:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 11:32:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516898731] [2024-11-08 11:32:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516898731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:00,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:32:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074681015] [2024-11-08 11:32:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:00,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:00,326 INFO L87 Difference]: Start difference. First operand 5186 states and 6107 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:01,418 INFO L93 Difference]: Finished difference Result 10669 states and 12523 transitions. [2024-11-08 11:32:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:01,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 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 329 [2024-11-08 11:32:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:01,436 INFO L225 Difference]: With dead ends: 10669 [2024-11-08 11:32:01,437 INFO L226 Difference]: Without dead ends: 5485 [2024-11-08 11:32:01,444 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-08 11:32:01,445 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:01,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:32:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2024-11-08 11:32:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5485. [2024-11-08 11:32:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1692195477753464) internal successors, (6412), 5484 states have internal predecessors, (6412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6412 transitions. [2024-11-08 11:32:01,524 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6412 transitions. Word has length 329 [2024-11-08 11:32:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:01,525 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6412 transitions. [2024-11-08 11:32:01,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6412 transitions. [2024-11-08 11:32:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-08 11:32:01,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:01,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:32:01,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -68625954, now seen corresponding path program 1 times [2024-11-08 11:32:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:01,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555975463] [2024-11-08 11:32:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:32:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555975463] [2024-11-08 11:32:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555975463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:01,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816994546] [2024-11-08 11:32:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:01,794 INFO L87 Difference]: Start difference. First operand 5485 states and 6412 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-08 11:32:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:03,206 INFO L93 Difference]: Finished difference Result 12762 states and 15152 transitions. [2024-11-08 11:32:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:03,207 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 339 [2024-11-08 11:32:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:03,228 INFO L225 Difference]: With dead ends: 12762 [2024-11-08 11:32:03,228 INFO L226 Difference]: Without dead ends: 7578 [2024-11-08 11:32:03,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:03,235 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 263 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:03,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:32:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7578 states. [2024-11-08 11:32:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7578 to 4883. [2024-11-08 11:32:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4883 states, 4882 states have (on average 1.1798443260958624) internal successors, (5760), 4882 states have internal predecessors, (5760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 5760 transitions. [2024-11-08 11:32:03,315 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 5760 transitions. Word has length 339 [2024-11-08 11:32:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:03,316 INFO L471 AbstractCegarLoop]: Abstraction has 4883 states and 5760 transitions. [2024-11-08 11:32:03,316 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-08 11:32:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 5760 transitions. [2024-11-08 11:32:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-08 11:32:03,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:03,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:32:03,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 746881843, now seen corresponding path program 1 times [2024-11-08 11:32:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681697435] [2024-11-08 11:32:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:32:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681697435] [2024-11-08 11:32:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681697435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042453482] [2024-11-08 11:32:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:03,749 INFO L87 Difference]: Start difference. First operand 4883 states and 5760 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:05,023 INFO L93 Difference]: Finished difference Result 11270 states and 13601 transitions. [2024-11-08 11:32:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 404 [2024-11-08 11:32:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:05,038 INFO L225 Difference]: With dead ends: 11270 [2024-11-08 11:32:05,038 INFO L226 Difference]: Without dead ends: 6688 [2024-11-08 11:32:05,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:05,045 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:05,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 603 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:32:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2024-11-08 11:32:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 6087. [2024-11-08 11:32:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6087 states, 6086 states have (on average 1.1625041077883667) internal successors, (7075), 6086 states have internal predecessors, (7075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 7075 transitions. [2024-11-08 11:32:05,162 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 7075 transitions. Word has length 404 [2024-11-08 11:32:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:05,163 INFO L471 AbstractCegarLoop]: Abstraction has 6087 states and 7075 transitions. [2024-11-08 11:32:05,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 7075 transitions. [2024-11-08 11:32:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-11-08 11:32:05,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:05,170 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:05,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:32:05,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:05,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash -564953075, now seen corresponding path program 1 times [2024-11-08 11:32:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319208401] [2024-11-08 11:32:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:32:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319208401] [2024-11-08 11:32:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319208401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180492710] [2024-11-08 11:32:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:05,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:05,481 INFO L87 Difference]: Start difference. First operand 6087 states and 7075 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:06,682 INFO L93 Difference]: Finished difference Result 13667 states and 16218 transitions. [2024-11-08 11:32:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 421 [2024-11-08 11:32:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:06,695 INFO L225 Difference]: With dead ends: 13667 [2024-11-08 11:32:06,696 INFO L226 Difference]: Without dead ends: 7881 [2024-11-08 11:32:06,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:06,702 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:06,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:32:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-11-08 11:32:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7877. [2024-11-08 11:32:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1452513966480447) internal successors, (9020), 7876 states have internal predecessors, (9020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9020 transitions. [2024-11-08 11:32:06,793 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9020 transitions. Word has length 421 [2024-11-08 11:32:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:06,794 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9020 transitions. [2024-11-08 11:32:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9020 transitions. [2024-11-08 11:32:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-11-08 11:32:06,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:06,801 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:06,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:32:06,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1419669949, now seen corresponding path program 1 times [2024-11-08 11:32:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122291217] [2024-11-08 11:32:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 50 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:32:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122291217] [2024-11-08 11:32:07,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122291217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:32:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550700386] [2024-11-08 11:32:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:32:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:32:07,548 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-08 11:32:07,549 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-08 11:32:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:07,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:32:07,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:32:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:32:09,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:32:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550700386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:32:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:32:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406967597] [2024-11-08 11:32:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:32:09,672 INFO L87 Difference]: Start difference. First operand 7877 states and 9020 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:11,489 INFO L93 Difference]: Finished difference Result 19641 states and 22592 transitions. [2024-11-08 11:32:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 429 [2024-11-08 11:32:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:11,505 INFO L225 Difference]: With dead ends: 19641 [2024-11-08 11:32:11,505 INFO L226 Difference]: Without dead ends: 9673 [2024-11-08 11:32:11,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:32:11,513 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 301 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:11,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 590 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:32:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2024-11-08 11:32:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 9673. [2024-11-08 11:32:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9673 states, 9672 states have (on average 1.087882547559967) internal successors, (10522), 9672 states have internal predecessors, (10522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9673 states to 9673 states and 10522 transitions. [2024-11-08 11:32:11,611 INFO L78 Accepts]: Start accepts. Automaton has 9673 states and 10522 transitions. Word has length 429 [2024-11-08 11:32:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:11,612 INFO L471 AbstractCegarLoop]: Abstraction has 9673 states and 10522 transitions. [2024-11-08 11:32:11,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 9673 states and 10522 transitions. [2024-11-08 11:32:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-11-08 11:32:11,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:11,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:11,637 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-08 11:32:11,822 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,SelfDestructingSolverStorable9 [2024-11-08 11:32:11,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash -507123401, now seen corresponding path program 1 times [2024-11-08 11:32:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:11,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522069026] [2024-11-08 11:32:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 251 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:32:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522069026] [2024-11-08 11:32:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522069026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:32:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918996572] [2024-11-08 11:32:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:32:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:32:13,482 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-08 11:32:13,483 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-08 11:32:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:13,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:32:13,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:32:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:32:14,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:32:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:32:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918996572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:32:15,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:32:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-11-08 11:32:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803599683] [2024-11-08 11:32:15,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:32:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 11:32:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 11:32:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:32:15,531 INFO L87 Difference]: Start difference. First operand 9673 states and 10522 transitions. Second operand has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:22,074 INFO L93 Difference]: Finished difference Result 33822 states and 37264 transitions. [2024-11-08 11:32:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 11:32:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 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 574 [2024-11-08 11:32:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:22,116 INFO L225 Difference]: With dead ends: 33822 [2024-11-08 11:32:22,116 INFO L226 Difference]: Without dead ends: 24450 [2024-11-08 11:32:22,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1162 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-08 11:32:22,127 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 6410 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 7660 mSolverCounterSat, 2217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6410 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 9877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2217 IncrementalHoareTripleChecker+Valid, 7660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:22,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6410 Valid, 282 Invalid, 9877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2217 Valid, 7660 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 11:32:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24450 states. [2024-11-08 11:32:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24450 to 19255. [2024-11-08 11:32:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19255 states, 19254 states have (on average 1.0747896540978499) internal successors, (20694), 19254 states have internal predecessors, (20694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 20694 transitions. [2024-11-08 11:32:22,369 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 20694 transitions. Word has length 574 [2024-11-08 11:32:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 19255 states and 20694 transitions. [2024-11-08 11:32:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 20694 transitions. [2024-11-08 11:32:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2024-11-08 11:32:22,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:22,385 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:22,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 11:32:22,585 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-08 11:32:22,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:22,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1083835968, now seen corresponding path program 1 times [2024-11-08 11:32:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:22,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872725860] [2024-11-08 11:32:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-08 11:32:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872725860] [2024-11-08 11:32:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872725860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156965571] [2024-11-08 11:32:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:23,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:23,344 INFO L87 Difference]: Start difference. First operand 19255 states and 20694 transitions. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:24,287 INFO L93 Difference]: Finished difference Result 42094 states and 45195 transitions. [2024-11-08 11:32:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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 701 [2024-11-08 11:32:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:24,322 INFO L225 Difference]: With dead ends: 42094 [2024-11-08 11:32:24,322 INFO L226 Difference]: Without dead ends: 23140 [2024-11-08 11:32:24,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:24,341 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 218 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:24,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 574 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:32:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23140 states. [2024-11-08 11:32:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23140 to 22241. [2024-11-08 11:32:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22241 states, 22240 states have (on average 1.0680755395683452) internal successors, (23754), 22240 states have internal predecessors, (23754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22241 states to 22241 states and 23754 transitions. [2024-11-08 11:32:24,655 INFO L78 Accepts]: Start accepts. Automaton has 22241 states and 23754 transitions. Word has length 701 [2024-11-08 11:32:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:24,657 INFO L471 AbstractCegarLoop]: Abstraction has 22241 states and 23754 transitions. [2024-11-08 11:32:24,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 22241 states and 23754 transitions. [2024-11-08 11:32:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2024-11-08 11:32:24,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:24,672 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:32:24,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1141578840, now seen corresponding path program 1 times [2024-11-08 11:32:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732996220] [2024-11-08 11:32:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-08 11:32:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732996220] [2024-11-08 11:32:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732996220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:32:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302381171] [2024-11-08 11:32:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:25,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:32:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:32:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:32:25,595 INFO L87 Difference]: Start difference. First operand 22241 states and 23754 transitions. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:27,155 INFO L93 Difference]: Finished difference Result 51083 states and 54403 transitions. [2024-11-08 11:32:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:32:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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 749 [2024-11-08 11:32:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:27,198 INFO L225 Difference]: With dead ends: 51083 [2024-11-08 11:32:27,198 INFO L226 Difference]: Without dead ends: 29143 [2024-11-08 11:32:27,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:32:27,219 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 523 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:27,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 98 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:32:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29143 states. [2024-11-08 11:32:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29143 to 25532. [2024-11-08 11:32:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25532 states, 25531 states have (on average 1.0662332066899063) internal successors, (27222), 25531 states have internal predecessors, (27222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25532 states to 25532 states and 27222 transitions. [2024-11-08 11:32:27,697 INFO L78 Accepts]: Start accepts. Automaton has 25532 states and 27222 transitions. Word has length 749 [2024-11-08 11:32:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:27,698 INFO L471 AbstractCegarLoop]: Abstraction has 25532 states and 27222 transitions. [2024-11-08 11:32:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25532 states and 27222 transitions. [2024-11-08 11:32:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2024-11-08 11:32:27,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:27,885 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:27,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:32:27,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1557373609, now seen corresponding path program 1 times [2024-11-08 11:32:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500071352] [2024-11-08 11:32:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 575 proven. 511 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-08 11:32:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500071352] [2024-11-08 11:32:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500071352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:32:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938458517] [2024-11-08 11:32:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:29,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:32:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:32:29,487 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-08 11:32:29,488 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-08 11:32:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:29,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:32:29,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:32:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-11-08 11:32:29,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:32:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938458517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:29,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:32:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 11:32:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541255507] [2024-11-08 11:32:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:32:29,931 INFO L87 Difference]: Start difference. First operand 25532 states and 27222 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:31,067 INFO L93 Difference]: Finished difference Result 49863 states and 53212 transitions. [2024-11-08 11:32:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:31,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 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 853 [2024-11-08 11:32:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:31,091 INFO L225 Difference]: With dead ends: 49863 [2024-11-08 11:32:31,091 INFO L226 Difference]: Without dead ends: 24632 [2024-11-08 11:32:31,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:32:31,108 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 191 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:31,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 545 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:32:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24632 states. [2024-11-08 11:32:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24632 to 24632. [2024-11-08 11:32:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24632 states, 24631 states have (on average 1.0518452356786163) internal successors, (25908), 24631 states have internal predecessors, (25908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24632 states to 24632 states and 25908 transitions. [2024-11-08 11:32:31,403 INFO L78 Accepts]: Start accepts. Automaton has 24632 states and 25908 transitions. Word has length 853 [2024-11-08 11:32:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:31,404 INFO L471 AbstractCegarLoop]: Abstraction has 24632 states and 25908 transitions. [2024-11-08 11:32:31,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24632 states and 25908 transitions. [2024-11-08 11:32:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2024-11-08 11:32:31,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:31,428 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:31,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:32:31,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:32:31,629 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash 57523134, now seen corresponding path program 1 times [2024-11-08 11:32:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861742437] [2024-11-08 11:32:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-11-08 11:32:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861742437] [2024-11-08 11:32:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861742437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084927022] [2024-11-08 11:32:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:32,103 INFO L87 Difference]: Start difference. First operand 24632 states and 25908 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:33,238 INFO L93 Difference]: Finished difference Result 54043 states and 56967 transitions. [2024-11-08 11:32:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 912 [2024-11-08 11:32:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:33,274 INFO L225 Difference]: With dead ends: 54043 [2024-11-08 11:32:33,274 INFO L226 Difference]: Without dead ends: 29712 [2024-11-08 11:32:33,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:33,293 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 234 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:33,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 217 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:32:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29712 states. [2024-11-08 11:32:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29712 to 27320. [2024-11-08 11:32:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27320 states, 27319 states have (on average 1.052088290200959) internal successors, (28742), 27319 states have internal predecessors, (28742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27320 states to 27320 states and 28742 transitions. [2024-11-08 11:32:33,520 INFO L78 Accepts]: Start accepts. Automaton has 27320 states and 28742 transitions. Word has length 912 [2024-11-08 11:32:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:33,520 INFO L471 AbstractCegarLoop]: Abstraction has 27320 states and 28742 transitions. [2024-11-08 11:32:33,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27320 states and 28742 transitions. [2024-11-08 11:32:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2024-11-08 11:32:33,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:33,537 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:33,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:32:33,537 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:33,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1013848060, now seen corresponding path program 1 times [2024-11-08 11:32:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:33,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629221453] [2024-11-08 11:32:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:33,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2024-11-08 11:32:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629221453] [2024-11-08 11:32:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629221453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:34,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:32:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614443803] [2024-11-08 11:32:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:32:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:32:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:32:34,296 INFO L87 Difference]: Start difference. First operand 27320 states and 28742 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:35,995 INFO L93 Difference]: Finished difference Result 62414 states and 65612 transitions. [2024-11-08 11:32:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:32:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 950 [2024-11-08 11:32:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:36,024 INFO L225 Difference]: With dead ends: 62414 [2024-11-08 11:32:36,024 INFO L226 Difference]: Without dead ends: 30013 [2024-11-08 11:32:36,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:32:36,038 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 688 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:36,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 459 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:32:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2024-11-08 11:32:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 23417. [2024-11-08 11:32:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23417 states, 23416 states have (on average 1.0297659719849674) internal successors, (24113), 23416 states have internal predecessors, (24113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23417 states to 23417 states and 24113 transitions. [2024-11-08 11:32:36,244 INFO L78 Accepts]: Start accepts. Automaton has 23417 states and 24113 transitions. Word has length 950 [2024-11-08 11:32:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:36,245 INFO L471 AbstractCegarLoop]: Abstraction has 23417 states and 24113 transitions. [2024-11-08 11:32:36,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23417 states and 24113 transitions. [2024-11-08 11:32:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2024-11-08 11:32:36,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:36,260 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:36,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:32:36,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:36,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash -949870862, now seen corresponding path program 1 times [2024-11-08 11:32:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152375531] [2024-11-08 11:32:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-11-08 11:32:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152375531] [2024-11-08 11:32:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152375531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:36,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137245803] [2024-11-08 11:32:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:36,935 INFO L87 Difference]: Start difference. First operand 23417 states and 24113 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:37,765 INFO L93 Difference]: Finished difference Result 48325 states and 49788 transitions. [2024-11-08 11:32:37,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:37,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 980 [2024-11-08 11:32:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:37,788 INFO L225 Difference]: With dead ends: 48325 [2024-11-08 11:32:37,788 INFO L226 Difference]: Without dead ends: 25209 [2024-11-08 11:32:37,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:37,802 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 72 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:37,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 482 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:32:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25209 states. [2024-11-08 11:32:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25209 to 21915. [2024-11-08 11:32:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21915 states, 21914 states have (on average 1.028474947522132) internal successors, (22538), 21914 states have internal predecessors, (22538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 22538 transitions. [2024-11-08 11:32:37,982 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 22538 transitions. Word has length 980 [2024-11-08 11:32:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 21915 states and 22538 transitions. [2024-11-08 11:32:37,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 22538 transitions. [2024-11-08 11:32:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2024-11-08 11:32:37,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:37,997 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:32:37,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1902127356, now seen corresponding path program 1 times [2024-11-08 11:32:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921159327] [2024-11-08 11:32:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1842 backedges. 1472 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 11:32:38,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921159327] [2024-11-08 11:32:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921159327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:38,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316372756] [2024-11-08 11:32:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:38,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:38,838 INFO L87 Difference]: Start difference. First operand 21915 states and 22538 transitions. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:39,845 INFO L93 Difference]: Finished difference Result 48329 states and 49702 transitions. [2024-11-08 11:32:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 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 1064 [2024-11-08 11:32:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:39,868 INFO L225 Difference]: With dead ends: 48329 [2024-11-08 11:32:39,868 INFO L226 Difference]: Without dead ends: 26715 [2024-11-08 11:32:39,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:39,881 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 104 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:39,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 136 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:32:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26715 states. [2024-11-08 11:32:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26715 to 23111. [2024-11-08 11:32:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23111 states, 23110 states have (on average 1.0279099956728688) internal successors, (23755), 23110 states have internal predecessors, (23755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23111 states to 23111 states and 23755 transitions. [2024-11-08 11:32:40,163 INFO L78 Accepts]: Start accepts. Automaton has 23111 states and 23755 transitions. Word has length 1064 [2024-11-08 11:32:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 23111 states and 23755 transitions. [2024-11-08 11:32:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23111 states and 23755 transitions. [2024-11-08 11:32:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1693 [2024-11-08 11:32:40,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:32:40,191 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:32:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:32:40,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:32:40,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:32:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash -795674901, now seen corresponding path program 1 times [2024-11-08 11:32:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:32:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455129226] [2024-11-08 11:32:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:32:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:32:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:32:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6183 backedges. 4139 proven. 0 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2024-11-08 11:32:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:32:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455129226] [2024-11-08 11:32:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455129226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:32:40,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:32:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:32:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345598894] [2024-11-08 11:32:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:32:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:32:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:32:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:32:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:40,852 INFO L87 Difference]: Start difference. First operand 23111 states and 23755 transitions. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:32:41,534 INFO L93 Difference]: Finished difference Result 40197 states and 41296 transitions. [2024-11-08 11:32:41,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:32:41,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 1692 [2024-11-08 11:32:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:32:41,536 INFO L225 Difference]: With dead ends: 40197 [2024-11-08 11:32:41,536 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:32:41,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:32:41,548 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 173 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:32:41,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 122 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:32:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:32:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:32:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:32:41,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1692 [2024-11-08 11:32:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:32:41,550 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:32:41,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:32:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:32:41,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:32:41,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:32:41,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:32:41,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:32:41,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:32:45,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:32:45,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:32:45 BoogieIcfgContainer [2024-11-08 11:32:45,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:32:45,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:32:45,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:32:45,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:32:45,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:31:49" (3/4) ... [2024-11-08 11:32:45,928 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:32:45,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:32:45,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:32:45,962 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:32:45,963 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:32:46,165 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:32:46,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:32:46,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:32:46,167 INFO L158 Benchmark]: Toolchain (without parser) took 60834.56ms. Allocated memory was 151.0MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 122.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-08 11:32:46,167 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:32:46,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 976.23ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 103.9MB in the end (delta: 18.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-08 11:32:46,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 184.40ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 65.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 11:32:46,168 INFO L158 Benchmark]: Boogie Preprocessor took 364.62ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 65.3MB in the beginning and 177.7MB in the end (delta: -112.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-08 11:32:46,168 INFO L158 Benchmark]: RCFGBuilder took 2493.45ms. Allocated memory is still 241.2MB. Free memory was 177.7MB in the beginning and 83.0MB in the end (delta: 94.7MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2024-11-08 11:32:46,168 INFO L158 Benchmark]: TraceAbstraction took 56567.38ms. Allocated memory was 241.2MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 83.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-08 11:32:46,169 INFO L158 Benchmark]: Witness Printer took 240.71ms. Allocated memory is still 4.2GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 11:32:46,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 976.23ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 103.9MB in the end (delta: 18.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 184.40ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 65.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 364.62ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 65.3MB in the beginning and 177.7MB in the end (delta: -112.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2493.45ms. Allocated memory is still 241.2MB. Free memory was 177.7MB in the beginning and 83.0MB in the end (delta: 94.7MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * TraceAbstraction took 56567.38ms. Allocated memory was 241.2MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 83.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 240.71ms. Allocated memory is still 4.2GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 173]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.1s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11005 SdHoareTripleChecker+Valid, 28.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11005 mSDsluCounter, 7314 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 894 mSDsCounter, 5789 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24539 IncrementalHoareTripleChecker+Invalid, 30328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5789 mSolverCounterUnsat, 6420 mSDtfsCounter, 24539 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2522 GetRequests, 2470 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27320occurred in iteration=15, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 29806 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 12935 NumberOfCodeBlocks, 12935 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 13486 ConstructedInterpolants, 0 QuantifiedInterpolants, 35173 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2227 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 19551/20686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= ((long long) a29 + 15)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998)) && (3 == a2)) || ((((2 == a2) && (0 <= ((long long) a29 + 127))) && (((long long) a0 + 99) <= 0)) && (a29 <= 599998))) || ((((((long long) 89 + a4) <= 0) && (a29 <= 599998)) && (a2 == 4)) && ((43 < a29) || (((long long) a29 + 15) < 0)))) || ((((long long) a0 + 147) <= 0) && (a2 == 4))) || ((((a29 <= 41) && (2 == a2)) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0))) || ((((a29 <= 41) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((2 == a2) && (0 <= ((long long) a29 + 127))) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998))) || (((((0 <= ((long long) 97 + a0)) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (a29 <= 599998)) && (3 == a2))) || ((2 == a2) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 107481) <= 0))) || ((((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 107481) <= 0)) && (((long long) a4 + 86) <= 0))) || ((((long long) a0 + 147) <= 0) && (a2 == 1))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 599998)) && (((long long) a0 + 61) <= 0))) || (((a29 <= 41) && (0 <= ((long long) a29 + 127))) && (a2 == 1))) || (((((long long) 107 + a0) <= 0) && (5 <= a2)) && (((long long) a29 + 127) <= 0))) || (((((2 == a2) && (0 <= ((long long) a29 + 127))) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998))) || (((134656 <= a29) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((((0 <= ((long long) 97 + a0)) && (0 <= ((long long) a29 + 127))) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 16) <= 0)) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a29 + 127)) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998))) || ((((long long) a0 + 99) <= 0) && (((long long) 89 + a4) <= 0))) || ((((0 <= ((long long) a29 + 127)) && (((long long) 98 + a0) <= 0)) && (a29 <= 599998)) && (a2 == 4))) || ((((0 <= ((long long) a29 + 127)) && (((long long) 89 + a4) <= 0)) && (5 <= a2)) && (a29 <= 599998))) || ((((long long) a0 + 99) <= 0) && (3 == a2))) || (((((0 <= ((long long) a29 + 127)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 599998)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || (((a29 <= 41) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((long long) a0 + 147) <= 0) && (5 <= a2))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:32:46,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE