./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/Problem01_label03.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 9a49aea6b3c1edfc7fe3f8f7bab6422e16330d8432eb730cabe992a1ced0cbc2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:18:13,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:18:13,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:18:13,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:18:13,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:18:13,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:18:13,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:18:13,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:18:13,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:18:13,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:18:13,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:18:13,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:18:13,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:18:13,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:18:13,263 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:18:13,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:18:13,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:18:13,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:18:13,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:18:13,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:18:13,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:18:13,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:18:13,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:18:13,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:18:13,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:18:13,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:18:13,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:18:13,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:18:13,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:18:13,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:18:13,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:18:13,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:18:13,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:18:13,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:18:13,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:18:13,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:18:13,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:18:13,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:18:13,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:18:13,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:18:13,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:18:13,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:18:13,276 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 -> 9a49aea6b3c1edfc7fe3f8f7bab6422e16330d8432eb730cabe992a1ced0cbc2 [2024-11-21 21:18:13,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:18:13,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:18:13,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:18:13,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:18:13,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:18:13,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2024-11-21 21:18:15,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:18:15,333 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:18:15,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2024-11-21 21:18:15,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e65dd8c7/d75ff8587ae346a09410e4053784d5dd/FLAG760370cae [2024-11-21 21:18:15,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e65dd8c7/d75ff8587ae346a09410e4053784d5dd [2024-11-21 21:18:15,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:18:15,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:18:15,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:18:15,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:18:15,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:18:15,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488d8534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15, skipping insertion in model container [2024-11-21 21:18:15,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:18:15,746 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/Problem01_label03.c[21586,21599] [2024-11-21 21:18:15,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:18:15,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:18:15,872 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/Problem01_label03.c[21586,21599] [2024-11-21 21:18:15,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:18:15,904 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:18:15,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15 WrapperNode [2024-11-21 21:18:15,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:18:15,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:18:15,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:18:15,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:18:15,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,978 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-21 21:18:15,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:18:15,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:18:15,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:18:15,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:18:15,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:15,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,029 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-21 21:18:16,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:18:16,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:18:16,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:18:16,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:18:16,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (1/1) ... [2024-11-21 21:18:16,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:18:16,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:18:16,130 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-21 21:18:16,133 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-21 21:18:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:18:16,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:18:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:18:16,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:18:16,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:18:16,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:18:17,313 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-21 21:18:17,314 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:18:17,339 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:18:17,341 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:18:17,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:17 BoogieIcfgContainer [2024-11-21 21:18:17,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:18:17,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:18:17,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:18:17,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:18:17,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:18:15" (1/3) ... [2024-11-21 21:18:17,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24441913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:17, skipping insertion in model container [2024-11-21 21:18:17,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:15" (2/3) ... [2024-11-21 21:18:17,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24441913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:17, skipping insertion in model container [2024-11-21 21:18:17,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:17" (3/3) ... [2024-11-21 21:18:17,351 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2024-11-21 21:18:17,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:18:17,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:18:17,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:18:17,458 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;@43b3916c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:18:17,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:18:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-21 21:18:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-21 21:18:17,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:17,476 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] [2024-11-21 21:18:17,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1437018794, now seen corresponding path program 1 times [2024-11-21 21:18:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211957078] [2024-11-21 21:18:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:17,996 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-21 21:18:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211957078] [2024-11-21 21:18:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211957078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:17,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653362844] [2024-11-21 21:18:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:18,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:18,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:18,032 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:18,783 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-21 21:18:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-21 21:18:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:18,796 INFO L225 Difference]: With dead ends: 528 [2024-11-21 21:18:18,796 INFO L226 Difference]: Without dead ends: 266 [2024-11-21 21:18:18,799 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-21 21:18:18,802 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:18,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 66 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:18:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-21 21:18:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-21 21:18:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-21 21:18:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2024-11-21 21:18:18,849 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 129 [2024-11-21 21:18:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:18,850 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2024-11-21 21:18:18,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2024-11-21 21:18:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-21 21:18:18,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:18,854 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 21:18:18,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:18:18,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash -948534658, now seen corresponding path program 1 times [2024-11-21 21:18:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732663060] [2024-11-21 21:18:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:19,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732663060] [2024-11-21 21:18:19,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732663060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:19,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015881257] [2024-11-21 21:18:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:19,020 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:19,450 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2024-11-21 21:18:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:19,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-21 21:18:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:19,458 INFO L225 Difference]: With dead ends: 792 [2024-11-21 21:18:19,458 INFO L226 Difference]: Without dead ends: 528 [2024-11-21 21:18:19,459 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-21 21:18:19,460 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:19,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-21 21:18:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-21 21:18:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3681214421252372) internal successors, (721), 527 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-21 21:18:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2024-11-21 21:18:19,494 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 134 [2024-11-21 21:18:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:19,494 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2024-11-21 21:18:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2024-11-21 21:18:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-21 21:18:19,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:19,501 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] [2024-11-21 21:18:19,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:18:19,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -450807864, now seen corresponding path program 1 times [2024-11-21 21:18:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000044714] [2024-11-21 21:18:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:19,670 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-21 21:18:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000044714] [2024-11-21 21:18:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000044714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:19,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:19,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989727573] [2024-11-21 21:18:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:19,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:19,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:19,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:19,674 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-21 21:18:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:20,096 INFO L93 Difference]: Finished difference Result 1447 states and 1979 transitions. [2024-11-21 21:18:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-21 21:18:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:20,100 INFO L225 Difference]: With dead ends: 1447 [2024-11-21 21:18:20,100 INFO L226 Difference]: Without dead ends: 921 [2024-11-21 21:18:20,101 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-21 21:18:20,102 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:20,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-21 21:18:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-21 21:18:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3434782608695652) internal successors, (1236), 920 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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-21 21:18:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1236 transitions. [2024-11-21 21:18:20,136 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1236 transitions. Word has length 138 [2024-11-21 21:18:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:20,136 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1236 transitions. [2024-11-21 21:18:20,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-21 21:18:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1236 transitions. [2024-11-21 21:18:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-21 21:18:20,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:20,140 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 21:18:20,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:18:20,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash -583688942, now seen corresponding path program 1 times [2024-11-21 21:18:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679396827] [2024-11-21 21:18:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679396827] [2024-11-21 21:18:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679396827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44993939] [2024-11-21 21:18:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:20,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:20,384 INFO L87 Difference]: Start difference. First operand 921 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-21 21:18:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:20,766 INFO L93 Difference]: Finished difference Result 1840 states and 2470 transitions. [2024-11-21 21:18:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-21 21:18:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:20,770 INFO L225 Difference]: With dead ends: 1840 [2024-11-21 21:18:20,770 INFO L226 Difference]: Without dead ends: 921 [2024-11-21 21:18:20,772 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-21 21:18:20,773 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:20,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-21 21:18:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-21 21:18:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3304347826086957) internal successors, (1224), 920 states have internal predecessors, (1224), 0 states have call successors, (0), 0 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-21 21:18:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1224 transitions. [2024-11-21 21:18:20,797 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1224 transitions. Word has length 142 [2024-11-21 21:18:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1224 transitions. [2024-11-21 21:18:20,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-21 21:18:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1224 transitions. [2024-11-21 21:18:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-21 21:18:20,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:20,801 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 21:18:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:18:20,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:20,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 940831159, now seen corresponding path program 1 times [2024-11-21 21:18:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005256656] [2024-11-21 21:18:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005256656] [2024-11-21 21:18:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005256656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:21,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:21,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748346661] [2024-11-21 21:18:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:21,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:21,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:21,036 INFO L87 Difference]: Start difference. First operand 921 states and 1224 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-21 21:18:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:21,436 INFO L93 Difference]: Finished difference Result 2233 states and 2923 transitions. [2024-11-21 21:18:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-21 21:18:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:21,442 INFO L225 Difference]: With dead ends: 2233 [2024-11-21 21:18:21,443 INFO L226 Difference]: Without dead ends: 1314 [2024-11-21 21:18:21,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:21,445 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:21,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-21 21:18:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2024-11-21 21:18:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2825719120135364) internal successors, (1516), 1182 states have internal predecessors, (1516), 0 states have call successors, (0), 0 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-21 21:18:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1516 transitions. [2024-11-21 21:18:21,473 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1516 transitions. Word has length 144 [2024-11-21 21:18:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:21,473 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1516 transitions. [2024-11-21 21:18:21,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-21 21:18:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1516 transitions. [2024-11-21 21:18:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-21 21:18:21,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:21,477 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-21 21:18:21,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:18:21,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:21,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1745266705, now seen corresponding path program 1 times [2024-11-21 21:18:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:21,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032012584] [2024-11-21 21:18:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:21,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032012584] [2024-11-21 21:18:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032012584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94766456] [2024-11-21 21:18:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:21,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:21,725 INFO L87 Difference]: Start difference. First operand 1183 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-21 21:18:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:22,341 INFO L93 Difference]: Finished difference Result 2757 states and 3471 transitions. [2024-11-21 21:18:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:22,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-11-21 21:18:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:22,347 INFO L225 Difference]: With dead ends: 2757 [2024-11-21 21:18:22,347 INFO L226 Difference]: Without dead ends: 1576 [2024-11-21 21:18:22,349 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-21 21:18:22,350 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:22,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 59 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:18:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-21 21:18:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-21 21:18:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2479224376731302) internal successors, (1802), 1444 states have internal predecessors, (1802), 0 states have call successors, (0), 0 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-21 21:18:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1802 transitions. [2024-11-21 21:18:22,378 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1802 transitions. Word has length 148 [2024-11-21 21:18:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:22,378 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1802 transitions. [2024-11-21 21:18:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-21 21:18:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1802 transitions. [2024-11-21 21:18:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-21 21:18:22,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:22,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:18:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:18:22,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1830513870, now seen corresponding path program 1 times [2024-11-21 21:18:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87548945] [2024-11-21 21:18:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87548945] [2024-11-21 21:18:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87548945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:22,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514040829] [2024-11-21 21:18:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:22,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:22,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:22,569 INFO L87 Difference]: Start difference. First operand 1445 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-21 21:18:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:22,991 INFO L93 Difference]: Finished difference Result 3019 states and 3739 transitions. [2024-11-21 21:18:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:22,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-21 21:18:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:22,997 INFO L225 Difference]: With dead ends: 3019 [2024-11-21 21:18:22,998 INFO L226 Difference]: Without dead ends: 1576 [2024-11-21 21:18:23,000 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-21 21:18:23,001 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:23,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-11-21 21:18:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2024-11-21 21:18:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2049861495844876) internal successors, (1740), 1444 states have internal predecessors, (1740), 0 states have call successors, (0), 0 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-21 21:18:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1740 transitions. [2024-11-21 21:18:23,027 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1740 transitions. Word has length 166 [2024-11-21 21:18:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:23,027 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1740 transitions. [2024-11-21 21:18:23,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-21 21:18:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1740 transitions. [2024-11-21 21:18:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-21 21:18:23,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:23,031 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:18:23,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:18:23,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -721031857, now seen corresponding path program 1 times [2024-11-21 21:18:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988892797] [2024-11-21 21:18:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:18:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988892797] [2024-11-21 21:18:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988892797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:18:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322713519] [2024-11-21 21:18:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:18:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:18:23,568 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-21 21:18:23,569 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-21 21:18:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:23,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 21:18:23,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:18:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-21 21:18:23,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:18:23,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322713519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:18:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-21 21:18:23,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68936885] [2024-11-21 21:18:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:23,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:23,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:18:23,950 INFO L87 Difference]: Start difference. First operand 1445 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-21 21:18:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:24,343 INFO L93 Difference]: Finished difference Result 2233 states and 2642 transitions. [2024-11-21 21:18:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 179 [2024-11-21 21:18:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:24,351 INFO L225 Difference]: With dead ends: 2233 [2024-11-21 21:18:24,352 INFO L226 Difference]: Without dead ends: 2231 [2024-11-21 21:18:24,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:18:24,353 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:24,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2024-11-21 21:18:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2024-11-21 21:18:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1838565022421526) internal successors, (2640), 2230 states have internal predecessors, (2640), 0 states have call successors, (0), 0 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-21 21:18:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2640 transitions. [2024-11-21 21:18:24,394 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2640 transitions. Word has length 179 [2024-11-21 21:18:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:24,395 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2640 transitions. [2024-11-21 21:18:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-21 21:18:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2640 transitions. [2024-11-21 21:18:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-21 21:18:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:24,400 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:24,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 21:18:24,601 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-21 21:18:24,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:24,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1501638180, now seen corresponding path program 1 times [2024-11-21 21:18:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:24,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152228831] [2024-11-21 21:18:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-21 21:18:24,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:24,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152228831] [2024-11-21 21:18:24,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152228831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:24,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:24,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:18:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913437949] [2024-11-21 21:18:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:24,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:24,721 INFO L87 Difference]: Start difference. First operand 2231 states and 2640 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-21 21:18:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:25,123 INFO L93 Difference]: Finished difference Result 4853 states and 5762 transitions. [2024-11-21 21:18:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:25,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2024-11-21 21:18:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:25,131 INFO L225 Difference]: With dead ends: 4853 [2024-11-21 21:18:25,131 INFO L226 Difference]: Without dead ends: 2362 [2024-11-21 21:18:25,134 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-21 21:18:25,135 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 136 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:25,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 192 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:18:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2024-11-21 21:18:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2024-11-21 21:18:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.095722151630665) internal successors, (2587), 2361 states have internal predecessors, (2587), 0 states have call successors, (0), 0 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-21 21:18:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2587 transitions. [2024-11-21 21:18:25,175 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2587 transitions. Word has length 186 [2024-11-21 21:18:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:25,175 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 2587 transitions. [2024-11-21 21:18:25,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-21 21:18:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2587 transitions. [2024-11-21 21:18:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-21 21:18:25,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:25,180 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:18:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:18:25,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:25,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash -73226021, now seen corresponding path program 1 times [2024-11-21 21:18:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641212670] [2024-11-21 21:18:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-21 21:18:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641212670] [2024-11-21 21:18:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641212670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:18:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927158134] [2024-11-21 21:18:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:25,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:18:25,401 INFO L87 Difference]: Start difference. First operand 2362 states and 2587 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-21 21:18:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:25,759 INFO L93 Difference]: Finished difference Result 5377 states and 5911 transitions. [2024-11-21 21:18:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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-21 21:18:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:25,771 INFO L225 Difference]: With dead ends: 5377 [2024-11-21 21:18:25,771 INFO L226 Difference]: Without dead ends: 2886 [2024-11-21 21:18:25,775 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-21 21:18:25,775 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 97 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:25,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 50 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:18:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2024-11-21 21:18:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2886. [2024-11-21 21:18:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.0856152512998267) internal successors, (3132), 2885 states have internal predecessors, (3132), 0 states have call successors, (0), 0 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-21 21:18:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3132 transitions. [2024-11-21 21:18:25,832 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3132 transitions. Word has length 193 [2024-11-21 21:18:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 2886 states and 3132 transitions. [2024-11-21 21:18:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-21 21:18:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3132 transitions. [2024-11-21 21:18:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-21 21:18:25,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:25,839 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:18:25,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:18:25,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:25,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash -830677062, now seen corresponding path program 1 times [2024-11-21 21:18:25,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507864985] [2024-11-21 21:18:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:25,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:18:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507864985] [2024-11-21 21:18:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507864985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:18:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:18:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000049823] [2024-11-21 21:18:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:18:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:18:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:26,058 INFO L87 Difference]: Start difference. First operand 2886 states and 3132 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 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-21 21:18:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:26,623 INFO L93 Difference]: Finished difference Result 5770 states and 6262 transitions. [2024-11-21 21:18:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:18:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 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 206 [2024-11-21 21:18:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:26,634 INFO L225 Difference]: With dead ends: 5770 [2024-11-21 21:18:26,634 INFO L226 Difference]: Without dead ends: 2624 [2024-11-21 21:18:26,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:18:26,639 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 224 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:26,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 29 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:18:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-21 21:18:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2624. [2024-11-21 21:18:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.073198627525734) internal successors, (2815), 2623 states have internal predecessors, (2815), 0 states have call successors, (0), 0 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-21 21:18:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 2815 transitions. [2024-11-21 21:18:26,682 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 2815 transitions. Word has length 206 [2024-11-21 21:18:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:26,682 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 2815 transitions. [2024-11-21 21:18:26,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 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-21 21:18:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 2815 transitions. [2024-11-21 21:18:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-21 21:18:26,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:26,689 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-21 21:18:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:18:26,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:26,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash -160153905, now seen corresponding path program 1 times [2024-11-21 21:18:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323878602] [2024-11-21 21:18:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-21 21:18:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323878602] [2024-11-21 21:18:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323878602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:18:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054595070] [2024-11-21 21:18:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:18:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:18:27,288 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-21 21:18:27,290 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-21 21:18:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:27,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 21:18:27,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:18:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-21 21:18:27,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:18:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054595070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:27,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:18:27,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-21 21:18:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429936540] [2024-11-21 21:18:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:27,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:27,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:18:27,612 INFO L87 Difference]: Start difference. First operand 2624 states and 2815 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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-21 21:18:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:27,917 INFO L93 Difference]: Finished difference Result 2626 states and 2816 transitions. [2024-11-21 21:18:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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 274 [2024-11-21 21:18:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:27,926 INFO L225 Difference]: With dead ends: 2626 [2024-11-21 21:18:27,926 INFO L226 Difference]: Without dead ends: 2624 [2024-11-21 21:18:27,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:18:27,927 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:27,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:18:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-21 21:18:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1707. [2024-11-21 21:18:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.0773739742086752) internal successors, (1838), 1706 states have internal predecessors, (1838), 0 states have call successors, (0), 0 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-21 21:18:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1838 transitions. [2024-11-21 21:18:27,958 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1838 transitions. Word has length 274 [2024-11-21 21:18:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1838 transitions. [2024-11-21 21:18:27,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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-21 21:18:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1838 transitions. [2024-11-21 21:18:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-21 21:18:27,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:18:27,964 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 21:18:27,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 21:18:28,165 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,SelfDestructingSolverStorable11 [2024-11-21 21:18:28,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:18:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:18:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1411032617, now seen corresponding path program 1 times [2024-11-21 21:18:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:18:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451461272] [2024-11-21 21:18:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:18:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 62 proven. 221 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-21 21:18:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:18:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451461272] [2024-11-21 21:18:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451461272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:18:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437544154] [2024-11-21 21:18:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:18:28,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:18:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:18:28,777 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-21 21:18:28,779 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-21 21:18:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:18:28,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 21:18:28,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:18:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-21 21:18:29,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:18:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437544154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:18:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:18:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-21 21:18:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083973567] [2024-11-21 21:18:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:18:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:18:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:18:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:18:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:18:29,105 INFO L87 Difference]: Start difference. First operand 1707 states and 1838 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:18:29,403 INFO L93 Difference]: Finished difference Result 1707 states and 1838 transitions. [2024-11-21 21:18:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:18:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2024-11-21 21:18:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:18:29,405 INFO L225 Difference]: With dead ends: 1707 [2024-11-21 21:18:29,405 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:18:29,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:18:29,407 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:18:29,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:18:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:18:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:18:29,408 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-21 21:18:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:18:29,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2024-11-21 21:18:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:18:29,409 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:18:29,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:18:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:18:29,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:18:29,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:18:29,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 21:18:29,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:18:29,616 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:18:29,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:18:29,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:18:29,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:18:29 BoogieIcfgContainer [2024-11-21 21:18:29,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:18:29,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:18:29,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:18:29,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:18:29,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:17" (3/4) ... [2024-11-21 21:18:29,828 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:18:29,850 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:18:29,851 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:18:29,852 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:18:29,853 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:18:30,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:18:30,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:18:30,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:18:30,012 INFO L158 Benchmark]: Toolchain (without parser) took 14639.29ms. Allocated memory was 172.0MB in the beginning and 394.3MB in the end (delta: 222.3MB). Free memory was 134.7MB in the beginning and 147.0MB in the end (delta: -12.3MB). Peak memory consumption was 210.0MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,012 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:18:30,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.54ms. Allocated memory is still 172.0MB. Free memory was 134.7MB in the beginning and 104.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.99ms. Allocated memory is still 172.0MB. Free memory was 104.3MB in the beginning and 98.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,013 INFO L158 Benchmark]: Boogie Preprocessor took 109.30ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 92.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,013 INFO L158 Benchmark]: RCFGBuilder took 1250.54ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 58.4MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,014 INFO L158 Benchmark]: TraceAbstraction took 12480.21ms. Allocated memory was 172.0MB in the beginning and 394.3MB in the end (delta: 222.3MB). Free memory was 57.4MB in the beginning and 159.6MB in the end (delta: -102.2MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,014 INFO L158 Benchmark]: Witness Printer took 186.55ms. Allocated memory is still 394.3MB. Free memory was 159.6MB in the beginning and 147.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:18:30,016 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.14ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.54ms. Allocated memory is still 172.0MB. Free memory was 134.7MB in the beginning and 104.3MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.99ms. Allocated memory is still 172.0MB. Free memory was 104.3MB in the beginning and 98.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.30ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 92.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1250.54ms. Allocated memory is still 172.0MB. Free memory was 92.7MB in the beginning and 58.4MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12480.21ms. Allocated memory was 172.0MB in the beginning and 394.3MB in the end (delta: 222.3MB). Free memory was 57.4MB in the beginning and 159.6MB in the end (delta: -102.2MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. * Witness Printer took 186.55ms. Allocated memory is still 394.3MB. Free memory was 159.6MB in the beginning and 147.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 573]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1526 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1526 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4683 IncrementalHoareTripleChecker+Invalid, 5389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 706 mSolverCounterUnsat, 911 mSDtfsCounter, 4683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2886occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3052 NumberOfCodeBlocks, 3052 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3036 ConstructedInterpolants, 0 QuantifiedInterpolants, 12161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1311/1664 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: 593]: Loop Invariant Derived loop invariant: (((((((a21 == 1) && (a17 == 1)) && (a20 == 1)) || (((a7 <= 0) && (a21 == 1)) && (a16 <= 5))) || ((a8 <= 13) && (a21 <= 0))) || ((14 <= a8) && (a21 == 1))) || (((a20 != 1) && (a21 == 1)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:18:30,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE