./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label48.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/Problem03_label48.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 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:31:41,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:31:41,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:31:42,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:31:42,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:31:42,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:31:42,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:31:42,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:31:42,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:31:42,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:31:42,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:31:42,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:31:42,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:31:42,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:31:42,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:31:42,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:31:42,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:31:42,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:31:42,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:31:42,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:31:42,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:31:42,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:31:42,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:31:42,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:31:42,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:31:42,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:31:42,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:31:42,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:31:42,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:31:42,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:31:42,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:31:42,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:31:42,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:31:42,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:31:42,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:31:42,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:31:42,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:31:42,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:31:42,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:31:42,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:31:42,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:31:42,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:31:42,079 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 -> 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f [2024-11-08 10:31:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:31:42,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:31:42,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:31:42,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:31:42,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:31:42,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2024-11-08 10:31:44,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:31:44,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:31:44,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2024-11-08 10:31:44,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda8a3974/649eb4b9248944c0bfff831b10870d2f/FLAGfa52e2c7a [2024-11-08 10:31:44,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda8a3974/649eb4b9248944c0bfff831b10870d2f [2024-11-08 10:31:44,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:31:44,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:31:44,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:31:44,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:31:44,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:31:44,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:31:44" (1/1) ... [2024-11-08 10:31:44,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8807d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:44, skipping insertion in model container [2024-11-08 10:31:44,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:31:44" (1/1) ... [2024-11-08 10:31:44,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:31:45,033 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/Problem03_label48.c[58935,58948] [2024-11-08 10:31:45,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:31:45,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:31:45,214 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/Problem03_label48.c[58935,58948] [2024-11-08 10:31:45,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:31:45,245 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:31:45,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45 WrapperNode [2024-11-08 10:31:45,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:31:45,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:31:45,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:31:45,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:31:45,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,368 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:31:45,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:31:45,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:31:45,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:31:45,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:31:45,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,426 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:31:45,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:31:45,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:31:45,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:31:45,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:31:45,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (1/1) ... [2024-11-08 10:31:45,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:31:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:45,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:31:45,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:31:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:31:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:31:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:31:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:31:45,658 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:31:45,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:31:47,886 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:31:47,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:31:47,914 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:31:47,914 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:31:47,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:47 BoogieIcfgContainer [2024-11-08 10:31:47,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:31:47,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:31:47,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:31:47,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:31:47,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:31:44" (1/3) ... [2024-11-08 10:31:47,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26494d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:31:47, skipping insertion in model container [2024-11-08 10:31:47,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:31:45" (2/3) ... [2024-11-08 10:31:47,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26494d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:31:47, skipping insertion in model container [2024-11-08 10:31:47,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:47" (3/3) ... [2024-11-08 10:31:47,928 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2024-11-08 10:31:47,958 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:31:47,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:31:48,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:31:48,053 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;@440db79a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:31:48,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:31:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-08 10:31:48,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:48,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:48,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -819677325, now seen corresponding path program 1 times [2024-11-08 10:31:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261125512] [2024-11-08 10:31:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261125512] [2024-11-08 10:31:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261125512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252789326] [2024-11-08 10:31:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:48,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:48,976 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 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 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:49,956 INFO L93 Difference]: Finished difference Result 860 states and 1507 transitions. [2024-11-08 10:31:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2024-11-08 10:31:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:49,968 INFO L225 Difference]: With dead ends: 860 [2024-11-08 10:31:49,969 INFO L226 Difference]: Without dead ends: 465 [2024-11-08 10:31:49,971 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 10:31:49,973 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 121 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:49,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:31:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-08 10:31:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2024-11-08 10:31:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2024-11-08 10:31:50,029 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 183 [2024-11-08 10:31:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:50,030 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2024-11-08 10:31:50,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2024-11-08 10:31:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 10:31:50,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:50,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:50,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:31:50,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1598798580, now seen corresponding path program 1 times [2024-11-08 10:31:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652874194] [2024-11-08 10:31:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652874194] [2024-11-08 10:31:50,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652874194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395173119] [2024-11-08 10:31:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:50,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:50,250 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:51,150 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2024-11-08 10:31:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2024-11-08 10:31:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:51,159 INFO L225 Difference]: With dead ends: 1343 [2024-11-08 10:31:51,159 INFO L226 Difference]: Without dead ends: 886 [2024-11-08 10:31:51,165 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 10:31:51,166 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:51,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 89 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:31:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-08 10:31:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2024-11-08 10:31:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2024-11-08 10:31:51,245 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 191 [2024-11-08 10:31:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2024-11-08 10:31:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2024-11-08 10:31:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 10:31:51,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:51,253 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:31:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:31:51,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:51,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1173366829, now seen corresponding path program 1 times [2024-11-08 10:31:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028889674] [2024-11-08 10:31:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028889674] [2024-11-08 10:31:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028889674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:51,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445258756] [2024-11-08 10:31:51,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:51,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:51,485 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:52,142 INFO L93 Difference]: Finished difference Result 2573 states and 3946 transitions. [2024-11-08 10:31:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:52,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-11-08 10:31:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:52,148 INFO L225 Difference]: With dead ends: 2573 [2024-11-08 10:31:52,148 INFO L226 Difference]: Without dead ends: 1707 [2024-11-08 10:31:52,149 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 10:31:52,153 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:52,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 137 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-08 10:31:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1704. [2024-11-08 10:31:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.4486200822078685) internal successors, (2467), 1703 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2467 transitions. [2024-11-08 10:31:52,202 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2467 transitions. Word has length 192 [2024-11-08 10:31:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:52,206 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2467 transitions. [2024-11-08 10:31:52,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2467 transitions. [2024-11-08 10:31:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 10:31:52,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:52,209 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:31:52,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:31:52,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -531252135, now seen corresponding path program 1 times [2024-11-08 10:31:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507176378] [2024-11-08 10:31:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:52,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507176378] [2024-11-08 10:31:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507176378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850714284] [2024-11-08 10:31:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:52,465 INFO L87 Difference]: Start difference. First operand 1704 states and 2467 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:53,142 INFO L93 Difference]: Finished difference Result 4238 states and 6117 transitions. [2024-11-08 10:31:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-08 10:31:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:53,150 INFO L225 Difference]: With dead ends: 4238 [2024-11-08 10:31:53,150 INFO L226 Difference]: Without dead ends: 2536 [2024-11-08 10:31:53,152 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 10:31:53,153 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:53,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 112 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2024-11-08 10:31:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2535. [2024-11-08 10:31:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2534 states have (on average 1.4183109707971586) internal successors, (3594), 2534 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3594 transitions. [2024-11-08 10:31:53,183 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3594 transitions. Word has length 193 [2024-11-08 10:31:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3594 transitions. [2024-11-08 10:31:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3594 transitions. [2024-11-08 10:31:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 10:31:53,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:53,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:31:53,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -73581847, now seen corresponding path program 1 times [2024-11-08 10:31:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535838795] [2024-11-08 10:31:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535838795] [2024-11-08 10:31:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535838795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:53,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080714249] [2024-11-08 10:31:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:31:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:31:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:53,738 INFO L87 Difference]: Start difference. First operand 2535 states and 3594 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:54,461 INFO L93 Difference]: Finished difference Result 5382 states and 7712 transitions. [2024-11-08 10:31:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:31:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-11-08 10:31:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:54,469 INFO L225 Difference]: With dead ends: 5382 [2024-11-08 10:31:54,469 INFO L226 Difference]: Without dead ends: 2501 [2024-11-08 10:31:54,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:54,475 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 332 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:54,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 47 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:31:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2024-11-08 10:31:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2501. [2024-11-08 10:31:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.3132) internal successors, (3283), 2500 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3283 transitions. [2024-11-08 10:31:54,511 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3283 transitions. Word has length 198 [2024-11-08 10:31:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:54,511 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3283 transitions. [2024-11-08 10:31:54,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3283 transitions. [2024-11-08 10:31:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 10:31:54,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:54,515 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-08 10:31:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:31:54,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:54,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1371073778, now seen corresponding path program 1 times [2024-11-08 10:31:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180540238] [2024-11-08 10:31:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180540238] [2024-11-08 10:31:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180540238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:31:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928608394] [2024-11-08 10:31:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:31:54,903 INFO L87 Difference]: Start difference. First operand 2501 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:55,532 INFO L93 Difference]: Finished difference Result 7436 states and 9758 transitions. [2024-11-08 10:31:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 200 [2024-11-08 10:31:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:55,549 INFO L225 Difference]: With dead ends: 7436 [2024-11-08 10:31:55,550 INFO L226 Difference]: Without dead ends: 4937 [2024-11-08 10:31:55,554 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 10:31:55,555 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 204 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:55,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 126 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2024-11-08 10:31:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4937. [2024-11-08 10:31:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4936 states have (on average 1.200769854132901) internal successors, (5927), 4936 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 5927 transitions. [2024-11-08 10:31:55,639 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 5927 transitions. Word has length 200 [2024-11-08 10:31:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:55,640 INFO L471 AbstractCegarLoop]: Abstraction has 4937 states and 5927 transitions. [2024-11-08 10:31:55,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 5927 transitions. [2024-11-08 10:31:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 10:31:55,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:55,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:55,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:31:55,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:55,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash 673023940, now seen corresponding path program 1 times [2024-11-08 10:31:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256690742] [2024-11-08 10:31:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:56,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:56,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256690742] [2024-11-08 10:31:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256690742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:56,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:31:56,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:31:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485613302] [2024-11-08 10:31:56,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:56,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:31:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:31:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:56,156 INFO L87 Difference]: Start difference. First operand 4937 states and 5927 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:57,129 INFO L93 Difference]: Finished difference Result 11283 states and 13609 transitions. [2024-11-08 10:31:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:31:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-11-08 10:31:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:57,156 INFO L225 Difference]: With dead ends: 11283 [2024-11-08 10:31:57,156 INFO L226 Difference]: Without dead ends: 6174 [2024-11-08 10:31:57,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:31:57,163 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:57,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 112 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:31:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2024-11-08 10:31:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6173. [2024-11-08 10:31:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6173 states, 6172 states have (on average 1.2025275437459495) internal successors, (7422), 6172 states have internal predecessors, (7422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 7422 transitions. [2024-11-08 10:31:57,255 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 7422 transitions. Word has length 214 [2024-11-08 10:31:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:57,256 INFO L471 AbstractCegarLoop]: Abstraction has 6173 states and 7422 transitions. [2024-11-08 10:31:57,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 7422 transitions. [2024-11-08 10:31:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 10:31:57,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:57,263 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:57,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:31:57,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:57,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash 873129007, now seen corresponding path program 1 times [2024-11-08 10:31:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538514531] [2024-11-08 10:31:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:31:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538514531] [2024-11-08 10:31:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538514531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248355801] [2024-11-08 10:31:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:57,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:57,628 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 10:31:57,631 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 10:31:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:57,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:57,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 10:31:58,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248355801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930426814] [2024-11-08 10:31:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:58,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:58,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:58,033 INFO L87 Difference]: Start difference. First operand 6173 states and 7422 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:58,588 INFO L93 Difference]: Finished difference Result 12357 states and 14866 transitions. [2024-11-08 10:31:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:58,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 221 [2024-11-08 10:31:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:58,600 INFO L225 Difference]: With dead ends: 12357 [2024-11-08 10:31:58,600 INFO L226 Difference]: Without dead ends: 6186 [2024-11-08 10:31:58,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:58,605 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 41 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:58,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 312 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:31:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2024-11-08 10:31:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 6173. [2024-11-08 10:31:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6173 states, 6172 states have (on average 1.1926441996111472) internal successors, (7361), 6172 states have internal predecessors, (7361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 7361 transitions. [2024-11-08 10:31:58,664 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 7361 transitions. Word has length 221 [2024-11-08 10:31:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:58,665 INFO L471 AbstractCegarLoop]: Abstraction has 6173 states and 7361 transitions. [2024-11-08 10:31:58,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:31:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 7361 transitions. [2024-11-08 10:31:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 10:31:58,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:58,672 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:58,688 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 10:31:58,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:58,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:58,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:58,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1157024437, now seen corresponding path program 1 times [2024-11-08 10:31:58,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:58,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062835156] [2024-11-08 10:31:58,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:58,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:31:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062835156] [2024-11-08 10:31:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062835156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580249911] [2024-11-08 10:31:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:59,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:59,235 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 10:31:59,238 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 10:31:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:59,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:31:59,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:31:59,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580249911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386358088] [2024-11-08 10:31:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:59,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:59,560 INFO L87 Difference]: Start difference. First operand 6173 states and 7361 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:00,118 INFO L93 Difference]: Finished difference Result 15595 states and 18915 transitions. [2024-11-08 10:32:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 227 [2024-11-08 10:32:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:00,136 INFO L225 Difference]: With dead ends: 15595 [2024-11-08 10:32:00,137 INFO L226 Difference]: Without dead ends: 9424 [2024-11-08 10:32:00,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:00,147 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:00,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 334 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9424 states. [2024-11-08 10:32:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9424 to 9421. [2024-11-08 10:32:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9421 states, 9420 states have (on average 1.1491507430997876) internal successors, (10825), 9420 states have internal predecessors, (10825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9421 states to 9421 states and 10825 transitions. [2024-11-08 10:32:00,261 INFO L78 Accepts]: Start accepts. Automaton has 9421 states and 10825 transitions. Word has length 227 [2024-11-08 10:32:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:00,261 INFO L471 AbstractCegarLoop]: Abstraction has 9421 states and 10825 transitions. [2024-11-08 10:32:00,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9421 states and 10825 transitions. [2024-11-08 10:32:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 10:32:00,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:00,271 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, 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] [2024-11-08 10:32:00,285 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 10:32:00,475 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,SelfDestructingSolverStorable8 [2024-11-08 10:32:00,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:00,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 768090626, now seen corresponding path program 1 times [2024-11-08 10:32:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970549194] [2024-11-08 10:32:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970549194] [2024-11-08 10:32:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970549194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:32:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631560813] [2024-11-08 10:32:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:00,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:00,855 INFO L87 Difference]: Start difference. First operand 9421 states and 10825 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:01,420 INFO L93 Difference]: Finished difference Result 22527 states and 25784 transitions. [2024-11-08 10:32:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:01,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2024-11-08 10:32:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:01,442 INFO L225 Difference]: With dead ends: 22527 [2024-11-08 10:32:01,443 INFO L226 Difference]: Without dead ends: 13108 [2024-11-08 10:32:01,453 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 10:32:01,454 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 160 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:01,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 97 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2024-11-08 10:32:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 13102. [2024-11-08 10:32:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13102 states, 13101 states have (on average 1.1372414319517594) internal successors, (14899), 13101 states have internal predecessors, (14899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13102 states to 13102 states and 14899 transitions. [2024-11-08 10:32:01,636 INFO L78 Accepts]: Start accepts. Automaton has 13102 states and 14899 transitions. Word has length 246 [2024-11-08 10:32:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 13102 states and 14899 transitions. [2024-11-08 10:32:01,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13102 states and 14899 transitions. [2024-11-08 10:32:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 10:32:01,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:01,650 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:32:01,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:01,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1718686317, now seen corresponding path program 1 times [2024-11-08 10:32:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113655160] [2024-11-08 10:32:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:02,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113655160] [2024-11-08 10:32:02,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113655160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:02,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970950056] [2024-11-08 10:32:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:02,138 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 10:32:02,142 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 10:32:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:02,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:32:02,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:02,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:02,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970950056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:02,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:02,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083443569] [2024-11-08 10:32:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:02,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:02,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:02,502 INFO L87 Difference]: Start difference. First operand 13102 states and 14899 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:03,137 INFO L93 Difference]: Finished difference Result 30671 states and 35017 transitions. [2024-11-08 10:32:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:03,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2024-11-08 10:32:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:03,160 INFO L225 Difference]: With dead ends: 30671 [2024-11-08 10:32:03,160 INFO L226 Difference]: Without dead ends: 17571 [2024-11-08 10:32:03,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:03,174 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 147 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:03,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 124 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:32:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17571 states. [2024-11-08 10:32:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17571 to 17568. [2024-11-08 10:32:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17568 states, 17567 states have (on average 1.126714863095577) internal successors, (19793), 17567 states have internal predecessors, (19793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17568 states to 17568 states and 19793 transitions. [2024-11-08 10:32:03,344 INFO L78 Accepts]: Start accepts. Automaton has 17568 states and 19793 transitions. Word has length 253 [2024-11-08 10:32:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:03,345 INFO L471 AbstractCegarLoop]: Abstraction has 17568 states and 19793 transitions. [2024-11-08 10:32:03,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17568 states and 19793 transitions. [2024-11-08 10:32:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-08 10:32:03,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:03,364 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:03,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:32:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:03,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1461981408, now seen corresponding path program 1 times [2024-11-08 10:32:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681723256] [2024-11-08 10:32:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 10:32:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681723256] [2024-11-08 10:32:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681723256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619208225] [2024-11-08 10:32:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:03,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:03,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:03,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:32:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:04,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:04,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 10:32:04,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:04,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619208225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:04,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:04,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782865031] [2024-11-08 10:32:04,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:04,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:04,310 INFO L87 Difference]: Start difference. First operand 17568 states and 19793 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:04,976 INFO L93 Difference]: Finished difference Result 48759 states and 54947 transitions. [2024-11-08 10:32:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2024-11-08 10:32:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:05,024 INFO L225 Difference]: With dead ends: 48759 [2024-11-08 10:32:05,024 INFO L226 Difference]: Without dead ends: 31396 [2024-11-08 10:32:05,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:05,046 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:05,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 138 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31396 states. [2024-11-08 10:32:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31396 to 30987. [2024-11-08 10:32:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30987 states, 30986 states have (on average 1.1142774156070483) internal successors, (34527), 30986 states have internal predecessors, (34527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30987 states to 30987 states and 34527 transitions. [2024-11-08 10:32:05,419 INFO L78 Accepts]: Start accepts. Automaton has 30987 states and 34527 transitions. Word has length 271 [2024-11-08 10:32:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 30987 states and 34527 transitions. [2024-11-08 10:32:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30987 states and 34527 transitions. [2024-11-08 10:32:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-08 10:32:05,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:05,444 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:05,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:32:05,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:05,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:05,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 954656702, now seen corresponding path program 1 times [2024-11-08 10:32:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475909967] [2024-11-08 10:32:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475909967] [2024-11-08 10:32:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475909967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67802711] [2024-11-08 10:32:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:05,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:05,982 INFO L87 Difference]: Start difference. First operand 30987 states and 34527 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:06,578 INFO L93 Difference]: Finished difference Result 64614 states and 72397 transitions. [2024-11-08 10:32:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2024-11-08 10:32:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:06,614 INFO L225 Difference]: With dead ends: 64614 [2024-11-08 10:32:06,615 INFO L226 Difference]: Without dead ends: 33832 [2024-11-08 10:32:06,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:06,640 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 81 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:06,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 280 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33832 states. [2024-11-08 10:32:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33832 to 33829. [2024-11-08 10:32:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33829 states, 33828 states have (on average 1.118274801939222) internal successors, (37829), 33828 states have internal predecessors, (37829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33829 states to 33829 states and 37829 transitions. [2024-11-08 10:32:06,965 INFO L78 Accepts]: Start accepts. Automaton has 33829 states and 37829 transitions. Word has length 279 [2024-11-08 10:32:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:06,966 INFO L471 AbstractCegarLoop]: Abstraction has 33829 states and 37829 transitions. [2024-11-08 10:32:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 33829 states and 37829 transitions. [2024-11-08 10:32:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-08 10:32:06,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:06,993 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:32:06,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1094485198, now seen corresponding path program 1 times [2024-11-08 10:32:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642479310] [2024-11-08 10:32:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642479310] [2024-11-08 10:32:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642479310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035194379] [2024-11-08 10:32:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:07,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:07,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:32:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:07,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:32:07,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:32:07,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035194379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:07,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:07,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854865047] [2024-11-08 10:32:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:07,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:07,574 INFO L87 Difference]: Start difference. First operand 33829 states and 37829 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:07,927 INFO L93 Difference]: Finished difference Result 95515 states and 106987 transitions. [2024-11-08 10:32:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2024-11-08 10:32:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:07,992 INFO L225 Difference]: With dead ends: 95515 [2024-11-08 10:32:07,993 INFO L226 Difference]: Without dead ends: 61891 [2024-11-08 10:32:08,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:08,025 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 214 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:08,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 760 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:32:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61891 states. [2024-11-08 10:32:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61891 to 59656. [2024-11-08 10:32:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59656 states, 59655 states have (on average 1.1127483027407594) internal successors, (66381), 59655 states have internal predecessors, (66381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59656 states to 59656 states and 66381 transitions. [2024-11-08 10:32:08,761 INFO L78 Accepts]: Start accepts. Automaton has 59656 states and 66381 transitions. Word has length 320 [2024-11-08 10:32:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:08,761 INFO L471 AbstractCegarLoop]: Abstraction has 59656 states and 66381 transitions. [2024-11-08 10:32:08,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59656 states and 66381 transitions. [2024-11-08 10:32:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-08 10:32:08,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:08,807 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:32:08,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:32:09,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:32:09,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -757730789, now seen corresponding path program 1 times [2024-11-08 10:32:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603369011] [2024-11-08 10:32:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:09,193 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 10:32:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603369011] [2024-11-08 10:32:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603369011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:32:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:32:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512704817] [2024-11-08 10:32:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:09,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:09,196 INFO L87 Difference]: Start difference. First operand 59656 states and 66381 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:09,944 INFO L93 Difference]: Finished difference Result 111341 states and 124119 transitions. [2024-11-08 10:32:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2024-11-08 10:32:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:10,247 INFO L225 Difference]: With dead ends: 111341 [2024-11-08 10:32:10,247 INFO L226 Difference]: Without dead ends: 51890 [2024-11-08 10:32:10,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:32:10,291 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 199 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:10,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 313 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51890 states. [2024-11-08 10:32:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51890 to 51685. [2024-11-08 10:32:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51685 states, 51684 states have (on average 1.0956195340917885) internal successors, (56626), 51684 states have internal predecessors, (56626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51685 states to 51685 states and 56626 transitions. [2024-11-08 10:32:11,121 INFO L78 Accepts]: Start accepts. Automaton has 51685 states and 56626 transitions. Word has length 321 [2024-11-08 10:32:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:11,122 INFO L471 AbstractCegarLoop]: Abstraction has 51685 states and 56626 transitions. [2024-11-08 10:32:11,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51685 states and 56626 transitions. [2024-11-08 10:32:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-08 10:32:11,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:11,156 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:11,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:32:11,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 197966752, now seen corresponding path program 1 times [2024-11-08 10:32:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610391134] [2024-11-08 10:32:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-08 10:32:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610391134] [2024-11-08 10:32:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610391134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442689860] [2024-11-08 10:32:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:11,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:11,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:11,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:32:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:11,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:32:11,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-08 10:32:11,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442689860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91075382] [2024-11-08 10:32:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:11,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:11,897 INFO L87 Difference]: Start difference. First operand 51685 states and 56626 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 10:32:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:12,671 INFO L93 Difference]: Finished difference Result 123294 states and 135062 transitions. [2024-11-08 10:32:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:12,671 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 322 [2024-11-08 10:32:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:12,758 INFO L225 Difference]: With dead ends: 123294 [2024-11-08 10:32:12,758 INFO L226 Difference]: Without dead ends: 71814 [2024-11-08 10:32:12,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:12,792 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 42 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:12,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 325 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71814 states. [2024-11-08 10:32:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71814 to 69752. [2024-11-08 10:32:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69752 states, 69751 states have (on average 1.0899628679158722) internal successors, (76026), 69751 states have internal predecessors, (76026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69752 states to 69752 states and 76026 transitions. [2024-11-08 10:32:13,681 INFO L78 Accepts]: Start accepts. Automaton has 69752 states and 76026 transitions. Word has length 322 [2024-11-08 10:32:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 69752 states and 76026 transitions. [2024-11-08 10:32:13,682 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 10:32:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 69752 states and 76026 transitions. [2024-11-08 10:32:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-08 10:32:14,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:14,049 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 3, 3, 3, 3, 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] [2024-11-08 10:32:14,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:32:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:32:14,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 111359389, now seen corresponding path program 1 times [2024-11-08 10:32:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128031152] [2024-11-08 10:32:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 10:32:14,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:14,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128031152] [2024-11-08 10:32:14,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128031152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:14,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61113706] [2024-11-08 10:32:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:14,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:14,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:14,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:32:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:14,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:32:14,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 10:32:15,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61113706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148499210] [2024-11-08 10:32:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:15,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:32:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:15,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:32:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:32:15,049 INFO L87 Difference]: Start difference. First operand 69752 states and 76026 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:16,206 INFO L93 Difference]: Finished difference Result 216305 states and 235361 transitions. [2024-11-08 10:32:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:32:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 323 [2024-11-08 10:32:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:16,375 INFO L225 Difference]: With dead ends: 216305 [2024-11-08 10:32:16,376 INFO L226 Difference]: Without dead ends: 146758 [2024-11-08 10:32:16,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:32:16,428 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 492 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:16,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 294 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:32:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146758 states. [2024-11-08 10:32:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146758 to 146752. [2024-11-08 10:32:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146752 states, 146751 states have (on average 1.0852805091617774) internal successors, (159266), 146751 states have internal predecessors, (159266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146752 states to 146752 states and 159266 transitions. [2024-11-08 10:32:19,391 INFO L78 Accepts]: Start accepts. Automaton has 146752 states and 159266 transitions. Word has length 323 [2024-11-08 10:32:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:19,391 INFO L471 AbstractCegarLoop]: Abstraction has 146752 states and 159266 transitions. [2024-11-08 10:32:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 146752 states and 159266 transitions. [2024-11-08 10:32:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-08 10:32:19,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:32:19,487 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 3, 3, 3, 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] [2024-11-08 10:32:19,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:32:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:19,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:32:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:32:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1805841616, now seen corresponding path program 1 times [2024-11-08 10:32:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:32:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992736155] [2024-11-08 10:32:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:32:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 10:32:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:32:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992736155] [2024-11-08 10:32:20,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992736155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:32:20,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612961355] [2024-11-08 10:32:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:32:20,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:32:20,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:32:20,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:32:20,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:32:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:32:20,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:32:20,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:32:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-08 10:32:20,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:32:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612961355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:32:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:32:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:32:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593109386] [2024-11-08 10:32:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:32:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:32:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:32:20,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:32:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:20,465 INFO L87 Difference]: Start difference. First operand 146752 states and 159266 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:32:21,549 INFO L93 Difference]: Finished difference Result 254094 states and 275294 transitions. [2024-11-08 10:32:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:32:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 326 [2024-11-08 10:32:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:32:21,553 INFO L225 Difference]: With dead ends: 254094 [2024-11-08 10:32:21,553 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:32:21,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:32:21,661 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 205 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:32:21,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 299 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:32:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:32:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:32:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:32:21,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 326 [2024-11-08 10:32:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:32:21,663 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:32:21,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:32:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:32:21,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:32:21,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:32:21,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 10:32:21,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 10:32:21,874 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:32:21,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:32:27,475 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 414 DAG size of output: 387 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 10:32:31,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:32:31,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:32:31 BoogieIcfgContainer [2024-11-08 10:32:31,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:32:31,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:32:31,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:32:31,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:32:31,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:31:47" (3/4) ... [2024-11-08 10:32:31,262 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:32:31,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:32:31,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:32:31,306 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:32:31,308 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:32:31,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:32:31,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:32:31,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:32:31,604 INFO L158 Benchmark]: Toolchain (without parser) took 47145.11ms. Allocated memory was 178.3MB in the beginning and 11.7GB in the end (delta: 11.5GB). Free memory was 103.7MB in the beginning and 10.3GB in the end (delta: -10.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 10:32:31,604 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:32:31,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 783.33ms. Allocated memory is still 178.3MB. Free memory was 103.5MB in the beginning and 95.6MB in the end (delta: 7.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-08 10:32:31,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.38ms. Allocated memory is still 178.3MB. Free memory was 94.6MB in the beginning and 79.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:32:31,605 INFO L158 Benchmark]: Boogie Preprocessor took 140.07ms. Allocated memory is still 178.3MB. Free memory was 79.9MB in the beginning and 67.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:32:31,605 INFO L158 Benchmark]: RCFGBuilder took 2403.93ms. Allocated memory was 178.3MB in the beginning and 299.9MB in the end (delta: 121.6MB). Free memory was 67.4MB in the beginning and 229.2MB in the end (delta: -161.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-08 10:32:31,605 INFO L158 Benchmark]: TraceAbstraction took 43342.57ms. Allocated memory was 299.9MB in the beginning and 11.7GB in the end (delta: 11.4GB). Free memory was 228.2MB in the beginning and 10.3GB in the end (delta: -10.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-08 10:32:31,605 INFO L158 Benchmark]: Witness Printer took 343.71ms. Allocated memory is still 11.7GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 10:32:31,606 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.11ms. Allocated memory is still 178.3MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 783.33ms. Allocated memory is still 178.3MB. Free memory was 103.5MB in the beginning and 95.6MB in the end (delta: 7.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.38ms. Allocated memory is still 178.3MB. Free memory was 94.6MB in the beginning and 79.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.07ms. Allocated memory is still 178.3MB. Free memory was 79.9MB in the beginning and 67.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2403.93ms. Allocated memory was 178.3MB in the beginning and 299.9MB in the end (delta: 121.6MB). Free memory was 67.4MB in the beginning and 229.2MB in the end (delta: -161.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43342.57ms. Allocated memory was 299.9MB in the beginning and 11.7GB in the end (delta: 11.4GB). Free memory was 228.2MB in the beginning and 10.3GB in the end (delta: -10.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 343.71ms. Allocated memory is still 11.7GB. Free memory was 10.3GB in the beginning and 10.3GB in the end (delta: 27.3MB). 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: 1594]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3267 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3267 mSDsluCounter, 4069 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 765 mSDsCounter, 1668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10448 IncrementalHoareTripleChecker+Invalid, 12116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1668 mSolverCounterUnsat, 3304 mSDtfsCounter, 10448 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2303 GetRequests, 2266 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146752occurred in iteration=17, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4974 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 6743 NumberOfCodeBlocks, 6743 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6717 ConstructedInterpolants, 0 QuantifiedInterpolants, 22100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4220 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 3285/3389 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1)) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a11 <= 0)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a11 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a12 == 0)) && (a4 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 <= 0)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a6 != 1)) && (a11 <= 0)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a11 <= 0)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a12 == 0)) && (a27 == 1)) && (a4 <= 0)) && (a18 == 1))) || (((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a11 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:32:31,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE