./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label23.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 f869ff34b8d1fc9233da1bce651f8bc007d942cb0a36d4a975409aebb2d888b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:22:07,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:22:07,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:22:07,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:22:07,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:22:07,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:22:07,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:22:07,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:22:07,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:22:07,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:22:07,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:22:07,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:22:07,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:22:07,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:22:07,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:22:07,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:22:07,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:22:07,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:22:07,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:22:07,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:22:07,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:22:07,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:22:07,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:22:07,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:22:07,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:22:07,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:22:07,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:07,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:22:07,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:22:07,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:22:07,128 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 -> f869ff34b8d1fc9233da1bce651f8bc007d942cb0a36d4a975409aebb2d888b1 [2024-11-09 19:22:07,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:22:07,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:22:07,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:22:07,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:22:07,349 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:22:07,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label23.c [2024-11-09 19:22:08,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:22:08,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:22:08,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label23.c [2024-11-09 19:22:08,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b21273c/88f83e5860f54b478d5bd6d0bf26bbfe/FLAGad443a278 [2024-11-09 19:22:09,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b21273c/88f83e5860f54b478d5bd6d0bf26bbfe [2024-11-09 19:22:09,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:22:09,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:22:09,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:09,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:22:09,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:22:09,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a6490d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09, skipping insertion in model container [2024-11-09 19:22:09,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:22:09,336 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/Problem11_label23.c[9364,9377] [2024-11-09 19:22:09,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:09,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:22:09,570 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/Problem11_label23.c[9364,9377] [2024-11-09 19:22:09,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:09,654 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:22:09,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09 WrapperNode [2024-11-09 19:22:09,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:09,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:09,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:22:09,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:22:09,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,753 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:22:09,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:09,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:22:09,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:22:09,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:22:09,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,820 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-09 19:22:09,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:22:09,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:22:09,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:22:09,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:22:09,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (1/1) ... [2024-11-09 19:22:09,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:09,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:09,904 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-09 19:22:09,907 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-09 19:22:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:22:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:22:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:22:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:22:09,999 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:22:10,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:22:11,269 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:22:11,269 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:22:11,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:22:11,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:22:11,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:11 BoogieIcfgContainer [2024-11-09 19:22:11,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:22:11,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:22:11,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:22:11,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:22:11,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:22:09" (1/3) ... [2024-11-09 19:22:11,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e3c0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:11, skipping insertion in model container [2024-11-09 19:22:11,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:09" (2/3) ... [2024-11-09 19:22:11,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e3c0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:11, skipping insertion in model container [2024-11-09 19:22:11,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:11" (3/3) ... [2024-11-09 19:22:11,288 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label23.c [2024-11-09 19:22:11,311 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:22:11,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:22:11,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:22:11,375 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;@38c95141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:22:11,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:22:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 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-09 19:22:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 19:22:11,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:11,387 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] [2024-11-09 19:22:11,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash -747051017, now seen corresponding path program 1 times [2024-11-09 19:22:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380654715] [2024-11-09 19:22:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:11,747 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-09 19:22:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380654715] [2024-11-09 19:22:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380654715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619606589] [2024-11-09 19:22:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:11,777 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 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 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 19:22:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:12,835 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:22:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 19:22:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:12,847 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:22:12,847 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:22:12,849 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-09 19:22:12,851 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 282 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:12,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:22:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:22:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:22:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 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-09 19:22:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:22:12,901 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 67 [2024-11-09 19:22:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:22:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 19:22:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:22:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 19:22:12,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:12,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:12,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:22:12,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:12,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1146600334, now seen corresponding path program 1 times [2024-11-09 19:22:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:12,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406479472] [2024-11-09 19:22:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:13,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406479472] [2024-11-09 19:22:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406479472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:13,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:13,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108232581] [2024-11-09 19:22:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:13,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:13,048 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-09 19:22:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:13,804 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:22:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:13,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-09 19:22:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:13,810 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:22:13,811 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:22:13,812 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-09 19:22:13,813 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:13,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:22:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:22:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 0 states have call successors, (0), 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-09 19:22:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:22:13,845 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 136 [2024-11-09 19:22:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:22:13,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-09 19:22:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:22:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 19:22:13,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:13,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:22:13,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -270407404, now seen corresponding path program 1 times [2024-11-09 19:22:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663205467] [2024-11-09 19:22:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:14,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663205467] [2024-11-09 19:22:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663205467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896145558] [2024-11-09 19:22:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:14,087 INFO L87 Difference]: Start difference. First operand 794 states and 1564 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-09 19:22:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:14,903 INFO L93 Difference]: Finished difference Result 2331 states and 4625 transitions. [2024-11-09 19:22:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:14,904 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-09 19:22:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:14,909 INFO L225 Difference]: With dead ends: 2331 [2024-11-09 19:22:14,910 INFO L226 Difference]: Without dead ends: 1539 [2024-11-09 19:22:14,911 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-09 19:22:14,911 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 241 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:14,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 199 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-09 19:22:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1535. [2024-11-09 19:22:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8370273794002607) internal successors, (2818), 1534 states have internal predecessors, (2818), 0 states have call successors, (0), 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-09 19:22:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2818 transitions. [2024-11-09 19:22:14,933 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2818 transitions. Word has length 138 [2024-11-09 19:22:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:14,934 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2818 transitions. [2024-11-09 19:22:14,934 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-09 19:22:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2818 transitions. [2024-11-09 19:22:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 19:22:14,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:14,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:22:14,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:22:14,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:14,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2019793771, now seen corresponding path program 1 times [2024-11-09 19:22:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:14,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302212100] [2024-11-09 19:22:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302212100] [2024-11-09 19:22:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302212100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804253462] [2024-11-09 19:22:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:15,145 INFO L87 Difference]: Start difference. First operand 1535 states and 2818 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:15,927 INFO L93 Difference]: Finished difference Result 3276 states and 6167 transitions. [2024-11-09 19:22:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-11-09 19:22:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:15,934 INFO L225 Difference]: With dead ends: 3276 [2024-11-09 19:22:15,935 INFO L226 Difference]: Without dead ends: 1928 [2024-11-09 19:22:15,937 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-09 19:22:15,938 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 289 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:15,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 446 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-09 19:22:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-09 19:22:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.863825363825364) internal successors, (3586), 1924 states have internal predecessors, (3586), 0 states have call successors, (0), 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-09 19:22:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3586 transitions. [2024-11-09 19:22:15,966 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3586 transitions. Word has length 195 [2024-11-09 19:22:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:15,969 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3586 transitions. [2024-11-09 19:22:15,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3586 transitions. [2024-11-09 19:22:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:22:15,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:15,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:22:15,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:22:15,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:15,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1828115505, now seen corresponding path program 1 times [2024-11-09 19:22:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124599413] [2024-11-09 19:22:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:22:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:16,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124599413] [2024-11-09 19:22:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124599413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025493156] [2024-11-09 19:22:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:16,216 INFO L87 Difference]: Start difference. First operand 1925 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09 19:22:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:17,018 INFO L93 Difference]: Finished difference Result 4414 states and 8354 transitions. [2024-11-09 19:22:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 251 [2024-11-09 19:22:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:17,027 INFO L225 Difference]: With dead ends: 4414 [2024-11-09 19:22:17,027 INFO L226 Difference]: Without dead ends: 2676 [2024-11-09 19:22:17,029 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-09 19:22:17,030 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 251 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:17,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 516 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-09 19:22:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-09 19:22:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.8576612903225806) internal successors, (4607), 2480 states have internal predecessors, (4607), 0 states have call successors, (0), 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-09 19:22:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4607 transitions. [2024-11-09 19:22:17,060 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4607 transitions. Word has length 251 [2024-11-09 19:22:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 4607 transitions. [2024-11-09 19:22:17,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09 19:22:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4607 transitions. [2024-11-09 19:22:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 19:22:17,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:17,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:17,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:22:17,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:17,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1546439713, now seen corresponding path program 1 times [2024-11-09 19:22:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97443980] [2024-11-09 19:22:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 93 proven. 34 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:22:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97443980] [2024-11-09 19:22:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97443980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146513555] [2024-11-09 19:22:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:17,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:17,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:17,513 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-09 19:22:17,514 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-09 19:22:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:17,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:22:17,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:22:17,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:22:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146513555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:22:17,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:22:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782487531] [2024-11-09 19:22:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:22:17,728 INFO L87 Difference]: Start difference. First operand 2481 states and 4607 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09 19:22:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:18,546 INFO L93 Difference]: Finished difference Result 6445 states and 12145 transitions. [2024-11-09 19:22:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:18,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 257 [2024-11-09 19:22:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:18,561 INFO L225 Difference]: With dead ends: 6445 [2024-11-09 19:22:18,562 INFO L226 Difference]: Without dead ends: 3966 [2024-11-09 19:22:18,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:22:18,566 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 284 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:18,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 395 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2024-11-09 19:22:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3963. [2024-11-09 19:22:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.861686017163049) internal successors, (7376), 3962 states have internal predecessors, (7376), 0 states have call successors, (0), 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-09 19:22:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 7376 transitions. [2024-11-09 19:22:18,617 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 7376 transitions. Word has length 257 [2024-11-09 19:22:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 7376 transitions. [2024-11-09 19:22:18,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09 19:22:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 7376 transitions. [2024-11-09 19:22:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-09 19:22:18,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:18,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:18,634 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-09 19:22:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:22:18,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:18,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash -309222403, now seen corresponding path program 1 times [2024-11-09 19:22:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036325428] [2024-11-09 19:22:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:19,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036325428] [2024-11-09 19:22:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036325428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195593293] [2024-11-09 19:22:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:19,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:19,074 INFO L87 Difference]: Start difference. First operand 3963 states and 7376 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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-09 19:22:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:20,352 INFO L93 Difference]: Finished difference Result 12219 states and 23163 transitions. [2024-11-09 19:22:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 296 [2024-11-09 19:22:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:20,379 INFO L225 Difference]: With dead ends: 12219 [2024-11-09 19:22:20,379 INFO L226 Difference]: Without dead ends: 8443 [2024-11-09 19:22:20,384 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-09 19:22:20,385 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 527 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:20,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 95 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:22:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8443 states. [2024-11-09 19:22:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8443 to 8441. [2024-11-09 19:22:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8440 states have (on average 1.8777251184834123) internal successors, (15848), 8440 states have internal predecessors, (15848), 0 states have call successors, (0), 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-09 19:22:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 15848 transitions. [2024-11-09 19:22:20,495 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 15848 transitions. Word has length 296 [2024-11-09 19:22:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 8441 states and 15848 transitions. [2024-11-09 19:22:20,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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-09 19:22:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 15848 transitions. [2024-11-09 19:22:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-09 19:22:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:20,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-09 19:22:20,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:22:20,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:20,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1322274254, now seen corresponding path program 1 times [2024-11-09 19:22:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209709352] [2024-11-09 19:22:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:22:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209709352] [2024-11-09 19:22:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209709352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456531992] [2024-11-09 19:22:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:20,736 INFO L87 Difference]: Start difference. First operand 8441 states and 15848 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 19:22:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:21,483 INFO L93 Difference]: Finished difference Result 17429 states and 33062 transitions. [2024-11-09 19:22:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2024-11-09 19:22:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:21,505 INFO L225 Difference]: With dead ends: 17429 [2024-11-09 19:22:21,505 INFO L226 Difference]: Without dead ends: 10291 [2024-11-09 19:22:21,516 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-09 19:22:21,516 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 277 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:21,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 156 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10291 states. [2024-11-09 19:22:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10291 to 10291. [2024-11-09 19:22:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10291 states, 10290 states have (on average 1.855296404275996) internal successors, (19091), 10290 states have internal predecessors, (19091), 0 states have call successors, (0), 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-09 19:22:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10291 states to 10291 states and 19091 transitions. [2024-11-09 19:22:21,667 INFO L78 Accepts]: Start accepts. Automaton has 10291 states and 19091 transitions. Word has length 305 [2024-11-09 19:22:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:21,668 INFO L471 AbstractCegarLoop]: Abstraction has 10291 states and 19091 transitions. [2024-11-09 19:22:21,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 19:22:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10291 states and 19091 transitions. [2024-11-09 19:22:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-09 19:22:21,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:21,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:21,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:22:21,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1004379867, now seen corresponding path program 1 times [2024-11-09 19:22:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041415411] [2024-11-09 19:22:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:22:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041415411] [2024-11-09 19:22:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041415411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594250076] [2024-11-09 19:22:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:22,019 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-09 19:22:22,021 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-09 19:22:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:22,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:22:22,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:22:22,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:22:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:22:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594250076] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:22:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-09 19:22:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091380560] [2024-11-09 19:22:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:23,779 INFO L87 Difference]: Start difference. First operand 10291 states and 19091 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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-09 19:22:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:25,011 INFO L93 Difference]: Finished difference Result 23206 states and 43585 transitions. [2024-11-09 19:22:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 307 [2024-11-09 19:22:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:25,038 INFO L225 Difference]: With dead ends: 23206 [2024-11-09 19:22:25,038 INFO L226 Difference]: Without dead ends: 14218 [2024-11-09 19:22:25,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:25,049 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 508 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:25,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 201 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:22:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2024-11-09 19:22:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 10476. [2024-11-09 19:22:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10476 states, 10475 states have (on average 1.8538424821002386) internal successors, (19419), 10475 states have internal predecessors, (19419), 0 states have call successors, (0), 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-09 19:22:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10476 states to 10476 states and 19419 transitions. [2024-11-09 19:22:25,177 INFO L78 Accepts]: Start accepts. Automaton has 10476 states and 19419 transitions. Word has length 307 [2024-11-09 19:22:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 10476 states and 19419 transitions. [2024-11-09 19:22:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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-09 19:22:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10476 states and 19419 transitions. [2024-11-09 19:22:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 19:22:25,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:25,186 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-09 19:22:25,199 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-09 19:22:25,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 19:22:25,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:25,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1792017994, now seen corresponding path program 1 times [2024-11-09 19:22:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:25,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607375677] [2024-11-09 19:22:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 218 proven. 122 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:22:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:25,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607375677] [2024-11-09 19:22:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607375677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:22:25,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322829863] [2024-11-09 19:22:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:25,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:25,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:25,699 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-09 19:22:25,700 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-09 19:22:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:25,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:22:25,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:22:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 19:22:25,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:22:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322829863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:22:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:22:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983144447] [2024-11-09 19:22:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:25,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:25,868 INFO L87 Difference]: Start difference. First operand 10476 states and 19419 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:26,608 INFO L93 Difference]: Finished difference Result 22053 states and 41211 transitions. [2024-11-09 19:22:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2024-11-09 19:22:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:26,629 INFO L225 Difference]: With dead ends: 22053 [2024-11-09 19:22:26,629 INFO L226 Difference]: Without dead ends: 12695 [2024-11-09 19:22:26,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:22:26,674 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 254 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:26,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 500 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12695 states. [2024-11-09 19:22:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12695 to 12695. [2024-11-09 19:22:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12695 states, 12694 states have (on average 1.853237750118166) internal successors, (23525), 12694 states have internal predecessors, (23525), 0 states have call successors, (0), 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-09 19:22:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12695 states to 12695 states and 23525 transitions. [2024-11-09 19:22:26,850 INFO L78 Accepts]: Start accepts. Automaton has 12695 states and 23525 transitions. Word has length 332 [2024-11-09 19:22:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 12695 states and 23525 transitions. [2024-11-09 19:22:26,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 12695 states and 23525 transitions. [2024-11-09 19:22:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-09 19:22:26,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:26,861 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:26,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:22:27,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:22:27,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:27,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1473305846, now seen corresponding path program 1 times [2024-11-09 19:22:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932214142] [2024-11-09 19:22:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:22:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932214142] [2024-11-09 19:22:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932214142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:27,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:27,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320346806] [2024-11-09 19:22:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:27,200 INFO L87 Difference]: Start difference. First operand 12695 states and 23525 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-09 19:22:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:27,896 INFO L93 Difference]: Finished difference Result 23129 states and 42789 transitions. [2024-11-09 19:22:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 354 [2024-11-09 19:22:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:27,908 INFO L225 Difference]: With dead ends: 23129 [2024-11-09 19:22:27,909 INFO L226 Difference]: Without dead ends: 11177 [2024-11-09 19:22:27,916 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-09 19:22:27,917 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 256 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:27,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 149 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2024-11-09 19:22:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 9323. [2024-11-09 19:22:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9323 states, 9322 states have (on average 1.8143102338553958) internal successors, (16913), 9322 states have internal predecessors, (16913), 0 states have call successors, (0), 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-09 19:22:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9323 states to 9323 states and 16913 transitions. [2024-11-09 19:22:28,008 INFO L78 Accepts]: Start accepts. Automaton has 9323 states and 16913 transitions. Word has length 354 [2024-11-09 19:22:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:28,008 INFO L471 AbstractCegarLoop]: Abstraction has 9323 states and 16913 transitions. [2024-11-09 19:22:28,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-09 19:22:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 9323 states and 16913 transitions. [2024-11-09 19:22:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-09 19:22:28,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:28,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:22:28,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1162262507, now seen corresponding path program 1 times [2024-11-09 19:22:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158657928] [2024-11-09 19:22:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 19:22:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158657928] [2024-11-09 19:22:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158657928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:28,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538882416] [2024-11-09 19:22:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:28,182 INFO L87 Difference]: Start difference. First operand 9323 states and 16913 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:28,906 INFO L93 Difference]: Finished difference Result 19946 states and 36366 transitions. [2024-11-09 19:22:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2024-11-09 19:22:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:28,907 INFO L225 Difference]: With dead ends: 19946 [2024-11-09 19:22:28,907 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:22:28,919 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-09 19:22:28,920 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 258 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:28,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 445 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:22:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:22:28,921 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-09 19:22:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:22:28,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2024-11-09 19:22:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:28,921 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:22:28,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:22:28,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:22:28,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:22:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:22:28,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:28,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:22:29,454 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:22:29,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:22:29 BoogieIcfgContainer [2024-11-09 19:22:29,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:22:29,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:22:29,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:22:29,462 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:22:29,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:11" (3/4) ... [2024-11-09 19:22:29,463 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:22:29,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:22:29,480 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:22:29,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:22:29,482 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:22:29,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:22:29,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:22:29,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:22:29,592 INFO L158 Benchmark]: Toolchain (without parser) took 20503.96ms. Allocated memory was 199.2MB in the beginning and 627.0MB in the end (delta: 427.8MB). Free memory was 129.7MB in the beginning and 433.7MB in the end (delta: -304.0MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,592 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:22:29,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.44ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 145.6MB in the end (delta: -16.1MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.42ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 128.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,593 INFO L158 Benchmark]: Boogie Preprocessor took 123.27ms. Allocated memory is still 199.2MB. Free memory was 128.0MB in the beginning and 103.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,593 INFO L158 Benchmark]: IcfgBuilder took 1405.03ms. Allocated memory is still 199.2MB. Free memory was 103.7MB in the beginning and 69.2MB in the end (delta: 34.4MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,593 INFO L158 Benchmark]: TraceAbstraction took 18177.25ms. Allocated memory was 199.2MB in the beginning and 627.0MB in the end (delta: 427.8MB). Free memory was 68.2MB in the beginning and 453.6MB in the end (delta: -385.4MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,594 INFO L158 Benchmark]: Witness Printer took 130.06ms. Allocated memory is still 627.0MB. Free memory was 453.6MB in the beginning and 433.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:22:29,594 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.09ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.44ms. Allocated memory is still 199.2MB. Free memory was 129.5MB in the beginning and 145.6MB in the end (delta: -16.1MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.42ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 128.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.27ms. Allocated memory is still 199.2MB. Free memory was 128.0MB in the beginning and 103.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1405.03ms. Allocated memory is still 199.2MB. Free memory was 103.7MB in the beginning and 69.2MB in the end (delta: 34.4MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18177.25ms. Allocated memory was 199.2MB in the beginning and 627.0MB in the end (delta: 427.8MB). Free memory was 68.2MB in the beginning and 453.6MB in the end (delta: -385.4MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. * Witness Printer took 130.06ms. Allocated memory is still 627.0MB. Free memory was 453.6MB in the beginning and 433.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: 211]: 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, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3688 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3688 mSDsluCounter, 3454 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 1546 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10894 IncrementalHoareTripleChecker+Invalid, 12440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1546 mSolverCounterUnsat, 3082 mSDtfsCounter, 10894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1235 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12695occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 5814 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3905 NumberOfCodeBlocks, 3905 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4196 ConstructedInterpolants, 0 QuantifiedInterpolants, 16565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1247 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 3077/3487 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: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:22:29,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE