./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label40.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/Problem02_label40.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 f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:38:02,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:38:02,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:38:02,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:38:02,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:38:02,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:38:02,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:38:02,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:38:02,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:38:02,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:38:02,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:38:02,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:38:02,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:38:02,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:38:02,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:38:02,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:38:02,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:38:02,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:38:02,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:38:02,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:38:02,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:38:02,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:38:02,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:38:02,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:38:02,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:38:02,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:38:02,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:38:02,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:38:02,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:38:02,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:38:02,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:38:02,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:38:02,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:38:02,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:38:02,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:38:02,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:38:02,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:38:02,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:38:02,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:38:02,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:38:02,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:38:02,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:38:02,647 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 -> f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 [2024-11-09 18:38:02,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:38:02,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:38:02,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:38:02,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:38:02,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:38:02,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-09 18:38:04,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:38:04,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:38:04,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-09 18:38:04,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2868888/7af5a9aa8f864dab8c980407abbf692f/FLAG495282791 [2024-11-09 18:38:04,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2868888/7af5a9aa8f864dab8c980407abbf692f [2024-11-09 18:38:04,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:38:04,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:38:04,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:38:04,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:38:04,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:38:04,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:04" (1/1) ... [2024-11-09 18:38:04,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ad9672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:04, skipping insertion in model container [2024-11-09 18:38:04,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:04" (1/1) ... [2024-11-09 18:38:04,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:38:05,220 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/Problem02_label40.c[15538,15551] [2024-11-09 18:38:05,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:38:05,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:38:05,354 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/Problem02_label40.c[15538,15551] [2024-11-09 18:38:05,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:38:05,418 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:38:05,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05 WrapperNode [2024-11-09 18:38:05,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:38:05,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:38:05,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:38:05,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:38:05,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,516 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:38:05,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:38:05,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:38:05,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:38:05,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:38:05,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,571 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 18:38:05,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:38:05,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:38:05,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:38:05,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:38:05,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (1/1) ... [2024-11-09 18:38:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:38:05,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:38:05,656 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 18:38:05,659 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 18:38:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:38:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:38:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:38:05,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:38:05,880 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:38:05,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:38:06,932 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:38:06,933 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:38:06,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:38:06,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:38:06,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:06 BoogieIcfgContainer [2024-11-09 18:38:06,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:38:06,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:38:06,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:38:06,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:38:06,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:38:04" (1/3) ... [2024-11-09 18:38:06,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370f530a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:06, skipping insertion in model container [2024-11-09 18:38:06,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05" (2/3) ... [2024-11-09 18:38:06,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370f530a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:06, skipping insertion in model container [2024-11-09 18:38:06,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:06" (3/3) ... [2024-11-09 18:38:07,001 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label40.c [2024-11-09 18:38:07,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:38:07,019 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:38:07,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:38:07,097 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;@3c4a4a00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:38:07,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:38:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 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 18:38:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 18:38:07,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:07,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:38:07,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1753641889, now seen corresponding path program 1 times [2024-11-09 18:38:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301793471] [2024-11-09 18:38:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:07,654 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 18:38:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301793471] [2024-11-09 18:38:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301793471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608574888] [2024-11-09 18:38:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:07,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:07,684 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 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 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:38:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:08,511 INFO L93 Difference]: Finished difference Result 636 states and 1076 transitions. [2024-11-09 18:38:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-09 18:38:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:08,530 INFO L225 Difference]: With dead ends: 636 [2024-11-09 18:38:08,530 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 18:38:08,537 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 18:38:08,543 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:08,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 123 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:38:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 18:38:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-09 18:38:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.46875) internal successors, (470), 320 states have internal predecessors, (470), 0 states have call successors, (0), 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 18:38:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 470 transitions. [2024-11-09 18:38:08,620 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 470 transitions. Word has length 91 [2024-11-09 18:38:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 470 transitions. [2024-11-09 18:38:08,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 18:38:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 470 transitions. [2024-11-09 18:38:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 18:38:08,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:08,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:38:08,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:38:08,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1363842843, now seen corresponding path program 1 times [2024-11-09 18:38:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482830750] [2024-11-09 18:38:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:09,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482830750] [2024-11-09 18:38:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482830750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941519932] [2024-11-09 18:38:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:38:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:09,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:38:09,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:38:09,055 INFO L87 Difference]: Start difference. First operand 321 states and 470 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 18:38:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:09,829 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2024-11-09 18:38:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:38:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-09 18:38:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:09,836 INFO L225 Difference]: With dead ends: 1008 [2024-11-09 18:38:09,836 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 18:38:09,837 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 18:38:09,838 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 172 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:09,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 119 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:38:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 18:38:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-09 18:38:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.3559602649006623) internal successors, (819), 604 states have internal predecessors, (819), 0 states have call successors, (0), 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 18:38:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 819 transitions. [2024-11-09 18:38:09,865 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 819 transitions. Word has length 96 [2024-11-09 18:38:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:09,866 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 819 transitions. [2024-11-09 18:38:09,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 18:38:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 819 transitions. [2024-11-09 18:38:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 18:38:09,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:09,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:38:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:38:09,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1574892355, now seen corresponding path program 1 times [2024-11-09 18:38:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782451276] [2024-11-09 18:38:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:10,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782451276] [2024-11-09 18:38:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782451276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042400883] [2024-11-09 18:38:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:10,048 INFO L87 Difference]: Start difference. First operand 605 states and 819 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 18:38:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:10,493 INFO L93 Difference]: Finished difference Result 1796 states and 2436 transitions. [2024-11-09 18:38:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-09 18:38:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:10,498 INFO L225 Difference]: With dead ends: 1796 [2024-11-09 18:38:10,498 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 18:38:10,499 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 18:38:10,501 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:10,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 103 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 18:38:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1182. [2024-11-09 18:38:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.310753598645216) internal successors, (1548), 1181 states have internal predecessors, (1548), 0 states have call successors, (0), 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 18:38:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1548 transitions. [2024-11-09 18:38:10,551 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1548 transitions. Word has length 110 [2024-11-09 18:38:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1548 transitions. [2024-11-09 18:38:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 18:38:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1548 transitions. [2024-11-09 18:38:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 18:38:10,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:10,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:38:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:38:10,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1665121586, now seen corresponding path program 1 times [2024-11-09 18:38:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804451007] [2024-11-09 18:38:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:10,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804451007] [2024-11-09 18:38:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804451007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:10,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:10,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936502230] [2024-11-09 18:38:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:10,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:10,703 INFO L87 Difference]: Start difference. First operand 1182 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 18:38:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:11,180 INFO L93 Difference]: Finished difference Result 3354 states and 4417 transitions. [2024-11-09 18:38:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-09 18:38:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:11,189 INFO L225 Difference]: With dead ends: 3354 [2024-11-09 18:38:11,189 INFO L226 Difference]: Without dead ends: 2174 [2024-11-09 18:38:11,192 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 18:38:11,196 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:11,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 131 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-11-09 18:38:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2171. [2024-11-09 18:38:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2170 states have (on average 1.2004608294930876) internal successors, (2605), 2170 states have internal predecessors, (2605), 0 states have call successors, (0), 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 18:38:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2605 transitions. [2024-11-09 18:38:11,245 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2605 transitions. Word has length 116 [2024-11-09 18:38:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:11,245 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 2605 transitions. [2024-11-09 18:38:11,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 18:38:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2605 transitions. [2024-11-09 18:38:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 18:38:11,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:11,252 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:38:11,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:38:11,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2120759181, now seen corresponding path program 1 times [2024-11-09 18:38:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:11,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496739404] [2024-11-09 18:38:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496739404] [2024-11-09 18:38:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496739404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:38:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723740892] [2024-11-09 18:38:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:11,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:38:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:38:11,653 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 18:38:11,657 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 18:38:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:11,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:38:11,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:38:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:38:11,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:38:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723740892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:11,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:38:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:38:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228415292] [2024-11-09 18:38:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:11,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:11,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:38:11,932 INFO L87 Difference]: Start difference. First operand 2171 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 18:38:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:12,430 INFO L93 Difference]: Finished difference Result 5045 states and 6163 transitions. [2024-11-09 18:38:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-09 18:38:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:12,442 INFO L225 Difference]: With dead ends: 5045 [2024-11-09 18:38:12,442 INFO L226 Difference]: Without dead ends: 2161 [2024-11-09 18:38:12,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:38:12,446 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:12,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:38:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2024-11-09 18:38:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2024-11-09 18:38:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2160 states have (on average 1.173148148148148) internal successors, (2534), 2160 states have internal predecessors, (2534), 0 states have call successors, (0), 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 18:38:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2534 transitions. [2024-11-09 18:38:12,485 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2534 transitions. Word has length 120 [2024-11-09 18:38:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2534 transitions. [2024-11-09 18:38:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 18:38:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2534 transitions. [2024-11-09 18:38:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 18:38:12,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:12,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 18:38:12,508 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 18:38:12,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:38:12,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:12,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash -511309652, now seen corresponding path program 1 times [2024-11-09 18:38:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:12,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681456081] [2024-11-09 18:38:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681456081] [2024-11-09 18:38:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681456081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564949404] [2024-11-09 18:38:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:12,797 INFO L87 Difference]: Start difference. First operand 2161 states and 2534 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 18:38:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:13,235 INFO L93 Difference]: Finished difference Result 4882 states and 5748 transitions. [2024-11-09 18:38:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-09 18:38:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:13,246 INFO L225 Difference]: With dead ends: 4882 [2024-11-09 18:38:13,247 INFO L226 Difference]: Without dead ends: 2723 [2024-11-09 18:38:13,250 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 18:38:13,253 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:13,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 51 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2024-11-09 18:38:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2722. [2024-11-09 18:38:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 1.1639103270856304) internal successors, (3167), 2721 states have internal predecessors, (3167), 0 states have call successors, (0), 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 18:38:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3167 transitions. [2024-11-09 18:38:13,312 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3167 transitions. Word has length 122 [2024-11-09 18:38:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 3167 transitions. [2024-11-09 18:38:13,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 18:38:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3167 transitions. [2024-11-09 18:38:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 18:38:13,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:13,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:38:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:38:13,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1466953314, now seen corresponding path program 1 times [2024-11-09 18:38:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217128113] [2024-11-09 18:38:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217128113] [2024-11-09 18:38:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217128113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:38:13,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079372027] [2024-11-09 18:38:13,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:13,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:38:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:38:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:38:13,569 INFO L87 Difference]: Start difference. First operand 2722 states and 3167 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 18:38:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:14,422 INFO L93 Difference]: Finished difference Result 5437 states and 6326 transitions. [2024-11-09 18:38:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:38:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-09 18:38:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:14,433 INFO L225 Difference]: With dead ends: 5437 [2024-11-09 18:38:14,433 INFO L226 Difference]: Without dead ends: 2717 [2024-11-09 18:38:14,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:38:14,438 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 339 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:14,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 135 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 18:38:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2024-11-09 18:38:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2717. [2024-11-09 18:38:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2716 states have (on average 1.1435935198821796) internal successors, (3106), 2716 states have internal predecessors, (3106), 0 states have call successors, (0), 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 18:38:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3106 transitions. [2024-11-09 18:38:14,518 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3106 transitions. Word has length 126 [2024-11-09 18:38:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:14,518 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3106 transitions. [2024-11-09 18:38:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 18:38:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3106 transitions. [2024-11-09 18:38:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 18:38:14,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:14,524 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:38:14,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:38:14,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1149002501, now seen corresponding path program 1 times [2024-11-09 18:38:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567550938] [2024-11-09 18:38:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 18:38:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567550938] [2024-11-09 18:38:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567550938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954709044] [2024-11-09 18:38:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:14,651 INFO L87 Difference]: Start difference. First operand 2717 states and 3106 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 18:38:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:15,102 INFO L93 Difference]: Finished difference Result 6283 states and 7280 transitions. [2024-11-09 18:38:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:15,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-09 18:38:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:15,117 INFO L225 Difference]: With dead ends: 6283 [2024-11-09 18:38:15,118 INFO L226 Difference]: Without dead ends: 3568 [2024-11-09 18:38:15,122 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 18:38:15,124 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 135 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:15,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 214 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2024-11-09 18:38:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 3143. [2024-11-09 18:38:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3142 states have (on average 1.1514958625079568) internal successors, (3618), 3142 states have internal predecessors, (3618), 0 states have call successors, (0), 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 18:38:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 3618 transitions. [2024-11-09 18:38:15,196 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 3618 transitions. Word has length 166 [2024-11-09 18:38:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 3143 states and 3618 transitions. [2024-11-09 18:38:15,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 18:38:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 3618 transitions. [2024-11-09 18:38:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 18:38:15,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:15,203 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 18:38:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:38:15,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -948780357, now seen corresponding path program 1 times [2024-11-09 18:38:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131258398] [2024-11-09 18:38:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 18:38:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131258398] [2024-11-09 18:38:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131258398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607511249] [2024-11-09 18:38:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:15,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:15,386 INFO L87 Difference]: Start difference. First operand 3143 states and 3618 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 18:38:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:15,827 INFO L93 Difference]: Finished difference Result 6989 states and 8039 transitions. [2024-11-09 18:38:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 182 [2024-11-09 18:38:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:15,840 INFO L225 Difference]: With dead ends: 6989 [2024-11-09 18:38:15,841 INFO L226 Difference]: Without dead ends: 3425 [2024-11-09 18:38:15,846 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 18:38:15,848 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 85 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:15,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 231 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2024-11-09 18:38:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3284. [2024-11-09 18:38:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3283 states have (on average 1.0938166311300639) internal successors, (3591), 3283 states have internal predecessors, (3591), 0 states have call successors, (0), 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 18:38:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 3591 transitions. [2024-11-09 18:38:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 3591 transitions. Word has length 182 [2024-11-09 18:38:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:15,915 INFO L471 AbstractCegarLoop]: Abstraction has 3284 states and 3591 transitions. [2024-11-09 18:38:15,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 18:38:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 3591 transitions. [2024-11-09 18:38:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 18:38:15,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:15,921 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:38:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:38:15,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 589714486, now seen corresponding path program 1 times [2024-11-09 18:38:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32682330] [2024-11-09 18:38:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 18:38:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32682330] [2024-11-09 18:38:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32682330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160823911] [2024-11-09 18:38:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:16,051 INFO L87 Difference]: Start difference. First operand 3284 states and 3591 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 18:38:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:16,470 INFO L93 Difference]: Finished difference Result 6990 states and 7630 transitions. [2024-11-09 18:38:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-11-09 18:38:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:16,486 INFO L225 Difference]: With dead ends: 6990 [2024-11-09 18:38:16,486 INFO L226 Difference]: Without dead ends: 3424 [2024-11-09 18:38:16,491 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 18:38:16,492 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 160 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:16,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 72 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2024-11-09 18:38:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3283. [2024-11-09 18:38:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3283 states, 3282 states have (on average 1.081048141377209) internal successors, (3548), 3282 states have internal predecessors, (3548), 0 states have call successors, (0), 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 18:38:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3283 states and 3548 transitions. [2024-11-09 18:38:16,551 INFO L78 Accepts]: Start accepts. Automaton has 3283 states and 3548 transitions. Word has length 206 [2024-11-09 18:38:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:16,552 INFO L471 AbstractCegarLoop]: Abstraction has 3283 states and 3548 transitions. [2024-11-09 18:38:16,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 18:38:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3283 states and 3548 transitions. [2024-11-09 18:38:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 18:38:16,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:16,558 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 18:38:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:38:16,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1531336895, now seen corresponding path program 1 times [2024-11-09 18:38:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191193646] [2024-11-09 18:38:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 18:38:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191193646] [2024-11-09 18:38:16,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191193646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359480273] [2024-11-09 18:38:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:16,669 INFO L87 Difference]: Start difference. First operand 3283 states and 3548 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 18:38:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:17,018 INFO L93 Difference]: Finished difference Result 6990 states and 7539 transitions. [2024-11-09 18:38:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 207 [2024-11-09 18:38:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:17,031 INFO L225 Difference]: With dead ends: 6990 [2024-11-09 18:38:17,031 INFO L226 Difference]: Without dead ends: 3283 [2024-11-09 18:38:17,036 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 18:38:17,037 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 88 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:17,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 237 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:38:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-11-09 18:38:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3278. [2024-11-09 18:38:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3277 states have (on average 1.0573695453158376) internal successors, (3465), 3277 states have internal predecessors, (3465), 0 states have call successors, (0), 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 18:38:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 3465 transitions. [2024-11-09 18:38:17,094 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 3465 transitions. Word has length 207 [2024-11-09 18:38:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:17,094 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 3465 transitions. [2024-11-09 18:38:17,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 18:38:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 3465 transitions. [2024-11-09 18:38:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 18:38:17,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:17,101 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-09 18:38:17,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:38:17,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -570393365, now seen corresponding path program 1 times [2024-11-09 18:38:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826174879] [2024-11-09 18:38:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 96 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826174879] [2024-11-09 18:38:17,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826174879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:38:17,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659014745] [2024-11-09 18:38:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:38:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:38:17,574 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 18:38:17,576 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 18:38:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:17,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:38:17,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:38:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 18:38:17,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:38:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659014745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:38:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:38:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847169609] [2024-11-09 18:38:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:38:17,851 INFO L87 Difference]: Start difference. First operand 3278 states and 3465 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 18:38:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:18,200 INFO L93 Difference]: Finished difference Result 5696 states and 6017 transitions. [2024-11-09 18:38:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 224 [2024-11-09 18:38:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:18,203 INFO L225 Difference]: With dead ends: 5696 [2024-11-09 18:38:18,203 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:38:18,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:38:18,209 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 69 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:18,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:38:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:38:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:38:18,210 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 18:38:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:38:18,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2024-11-09 18:38:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:18,210 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:38:18,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 18:38:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:38:18,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:38:18,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:38:18,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 18:38:18,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 18:38:18,424 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:38:18,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:38:18,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:38:18,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:38:18 BoogieIcfgContainer [2024-11-09 18:38:18,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:38:18,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:38:18,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:38:18,799 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:38:18,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:06" (3/4) ... [2024-11-09 18:38:18,802 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:38:18,825 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:38:18,827 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:38:18,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:38:18,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:38:18,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:38:18,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:38:18,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:38:18,981 INFO L158 Benchmark]: Toolchain (without parser) took 14124.67ms. Allocated memory was 172.0MB in the beginning and 320.9MB in the end (delta: 148.9MB). Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 2.0MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,981 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 172.0MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:38:18,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.51ms. Allocated memory is still 172.0MB. Free memory was 112.5MB in the beginning and 83.6MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.22ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 78.0MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,982 INFO L158 Benchmark]: Boogie Preprocessor took 100.47ms. Allocated memory is still 172.0MB. Free memory was 78.0MB in the beginning and 73.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,982 INFO L158 Benchmark]: IcfgBuilder took 1343.28ms. Allocated memory is still 172.0MB. Free memory was 73.8MB in the beginning and 60.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,982 INFO L158 Benchmark]: TraceAbstraction took 11833.72ms. Allocated memory was 172.0MB in the beginning and 320.9MB in the end (delta: 148.9MB). Free memory was 59.7MB in the beginning and 124.1MB in the end (delta: -64.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,983 INFO L158 Benchmark]: Witness Printer took 181.45ms. Allocated memory is still 320.9MB. Free memory was 124.1MB in the beginning and 110.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:38:18,984 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.31ms. Allocated memory is still 172.0MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.51ms. Allocated memory is still 172.0MB. Free memory was 112.5MB in the beginning and 83.6MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.22ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 78.0MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.47ms. Allocated memory is still 172.0MB. Free memory was 78.0MB in the beginning and 73.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1343.28ms. Allocated memory is still 172.0MB. Free memory was 73.8MB in the beginning and 60.2MB in the end (delta: 13.6MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11833.72ms. Allocated memory was 172.0MB in the beginning and 320.9MB in the end (delta: 148.9MB). Free memory was 59.7MB in the beginning and 124.1MB in the end (delta: -64.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * Witness Printer took 181.45ms. Allocated memory is still 320.9MB. Free memory was 124.1MB in the beginning and 110.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 449]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1684 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1684 mSDsluCounter, 1885 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 794 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5163 IncrementalHoareTripleChecker+Invalid, 5957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 794 mSolverCounterUnsat, 1600 mSDtfsCounter, 5163 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3284occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 727 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2096 ConstructedInterpolants, 0 QuantifiedInterpolants, 9600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1083/1205 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: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:38:19,017 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