./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label12.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 ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:02:54,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:02:54,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:02:54,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:02:54,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:02:54,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:02:54,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:02:54,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:02:54,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:02:54,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:02:54,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:02:54,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:02:54,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:02:54,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:02:54,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:02:54,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:02:54,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:02:54,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:02:54,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:02:54,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:02:54,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:02:54,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:02:54,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:02:54,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:02:54,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:02:54,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:02:54,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:02:54,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:02:54,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:02:54,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:02:54,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:02:54,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:02:54,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:02:54,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:02:54,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:02:54,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:02:54,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:02:54,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:02:54,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:02:54,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:02:54,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:02:54,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:02:54,839 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 -> ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 [2024-11-21 22:02:55,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:02:55,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:02:55,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:02:55,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:02:55,176 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:02:55,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2024-11-21 22:02:56,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:02:56,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:02:56,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2024-11-21 22:02:56,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abae67fd/9a1b7a9d37f3458095846b3342725a7b/FLAG04cdfac62 [2024-11-21 22:02:56,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abae67fd/9a1b7a9d37f3458095846b3342725a7b [2024-11-21 22:02:56,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:02:56,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:02:56,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:02:56,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:02:56,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:02:56,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:56" (1/1) ... [2024-11-21 22:02:56,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe01468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:56, skipping insertion in model container [2024-11-21 22:02:56,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:56" (1/1) ... [2024-11-21 22:02:56,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:02:57,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c[3684,3697] [2024-11-21 22:02:57,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:02:57,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:02:57,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c[3684,3697] [2024-11-21 22:02:57,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:02:57,652 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:02:57,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57 WrapperNode [2024-11-21 22:02:57,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:02:57,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:02:57,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:02:57,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:02:57,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,790 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-21 22:02:57,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:02:57,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:02:57,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:02:57,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:02:57,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 22:02:57,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:57,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:58,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:58,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:58,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:58,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:02:58,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:02:58,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:02:58,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:02:58,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (1/1) ... [2024-11-21 22:02:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:02:58,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:02:58,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 22:02:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 22:02:58,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:02:58,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:02:58,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:02:58,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:02:58,178 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:02:58,180 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:02:59,718 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-21 22:02:59,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:02:59,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:02:59,751 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:02:59,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:59 BoogieIcfgContainer [2024-11-21 22:02:59,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:02:59,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:02:59,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:02:59,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:02:59,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:02:56" (1/3) ... [2024-11-21 22:02:59,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7297f546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:59, skipping insertion in model container [2024-11-21 22:02:59,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:57" (2/3) ... [2024-11-21 22:02:59,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7297f546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:59, skipping insertion in model container [2024-11-21 22:02:59,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:59" (3/3) ... [2024-11-21 22:02:59,762 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label12.c [2024-11-21 22:02:59,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:02:59,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:02:59,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:02:59,856 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;@d9932ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:02:59,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:02:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:02:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 22:02:59,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:02:59,868 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] [2024-11-21 22:02:59,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:02:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:02:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1225036359, now seen corresponding path program 1 times [2024-11-21 22:02:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:02:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887419162] [2024-11-21 22:02:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:02:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:02:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887419162] [2024-11-21 22:03:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887419162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435367994] [2024-11-21 22:03:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:00,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:00,208 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:01,308 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2024-11-21 22:03:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-21 22:03:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:01,324 INFO L225 Difference]: With dead ends: 769 [2024-11-21 22:03:01,325 INFO L226 Difference]: Without dead ends: 422 [2024-11-21 22:03:01,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:01,332 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 215 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:01,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 22:03:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-21 22:03:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2024-11-21 22:03:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2024-11-21 22:03:01,403 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 25 [2024-11-21 22:03:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:01,404 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2024-11-21 22:03:01,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2024-11-21 22:03:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-21 22:03:01,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:01,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:01,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:03:01,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1252337339, now seen corresponding path program 1 times [2024-11-21 22:03:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595786037] [2024-11-21 22:03:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595786037] [2024-11-21 22:03:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595786037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:01,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:01,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314427858] [2024-11-21 22:03:01,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:01,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:01,639 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. 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-21 22:03:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:02,313 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2024-11-21 22:03:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:02,314 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-21 22:03:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:02,320 INFO L225 Difference]: With dead ends: 1194 [2024-11-21 22:03:02,320 INFO L226 Difference]: Without dead ends: 784 [2024-11-21 22:03:02,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:02,323 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:02,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-21 22:03:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-21 22:03:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2024-11-21 22:03:02,353 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 91 [2024-11-21 22:03:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:02,353 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2024-11-21 22:03:02,353 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-21 22:03:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2024-11-21 22:03:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-21 22:03:02,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:02,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:03:02,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:02,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1061626683, now seen corresponding path program 1 times [2024-11-21 22:03:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427280428] [2024-11-21 22:03:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:02,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427280428] [2024-11-21 22:03:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427280428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199269756] [2024-11-21 22:03:02,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:02,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:02,703 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:03,419 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2024-11-21 22:03:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-21 22:03:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:03,424 INFO L225 Difference]: With dead ends: 1936 [2024-11-21 22:03:03,424 INFO L226 Difference]: Without dead ends: 1154 [2024-11-21 22:03:03,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:03,427 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:03,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:03:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-21 22:03:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2024-11-21 22:03:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2024-11-21 22:03:03,450 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 95 [2024-11-21 22:03:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:03,451 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2024-11-21 22:03:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2024-11-21 22:03:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-21 22:03:03,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:03,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:03:03,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:03,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2063439108, now seen corresponding path program 1 times [2024-11-21 22:03:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595471157] [2024-11-21 22:03:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:03,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-21 22:03:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595471157] [2024-11-21 22:03:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595471157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:03:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830465892] [2024-11-21 22:03:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:03,724 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 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-21 22:03:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:04,417 INFO L93 Difference]: Finished difference Result 2494 states and 3189 transitions. [2024-11-21 22:03:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:04,418 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 137 [2024-11-21 22:03:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:04,425 INFO L225 Difference]: With dead ends: 2494 [2024-11-21 22:03:04,425 INFO L226 Difference]: Without dead ends: 1527 [2024-11-21 22:03:04,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:04,430 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:04,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:03:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-21 22:03:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2024-11-21 22:03:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2557377049180327) internal successors, (1915), 1525 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1915 transitions. [2024-11-21 22:03:04,459 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1915 transitions. Word has length 137 [2024-11-21 22:03:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:04,461 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1915 transitions. [2024-11-21 22:03:04,461 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-21 22:03:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1915 transitions. [2024-11-21 22:03:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-21 22:03:04,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:04,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:04,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:03:04,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash 215435237, now seen corresponding path program 1 times [2024-11-21 22:03:04,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:04,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001540887] [2024-11-21 22:03:04,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001540887] [2024-11-21 22:03:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001540887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333296584] [2024-11-21 22:03:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:04,692 INFO L87 Difference]: Start difference. First operand 1526 states and 1915 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:05,349 INFO L93 Difference]: Finished difference Result 2864 states and 3636 transitions. [2024-11-21 22:03:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:05,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-21 22:03:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:05,355 INFO L225 Difference]: With dead ends: 2864 [2024-11-21 22:03:05,356 INFO L226 Difference]: Without dead ends: 1524 [2024-11-21 22:03:05,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:05,358 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:05,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 306 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-21 22:03:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1524. [2024-11-21 22:03:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1523 states have (on average 1.2107682206172028) internal successors, (1844), 1523 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1844 transitions. [2024-11-21 22:03:05,381 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1844 transitions. Word has length 152 [2024-11-21 22:03:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:05,382 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1844 transitions. [2024-11-21 22:03:05,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1844 transitions. [2024-11-21 22:03:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-21 22:03:05,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:05,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:05,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:03:05,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:05,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash -422181944, now seen corresponding path program 1 times [2024-11-21 22:03:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:05,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809987249] [2024-11-21 22:03:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-21 22:03:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:05,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809987249] [2024-11-21 22:03:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809987249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:05,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558692854] [2024-11-21 22:03:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:05,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:05,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:05,645 INFO L87 Difference]: Start difference. First operand 1524 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:06,454 INFO L93 Difference]: Finished difference Result 3603 states and 4427 transitions. [2024-11-21 22:03:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-21 22:03:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:06,465 INFO L225 Difference]: With dead ends: 3603 [2024-11-21 22:03:06,466 INFO L226 Difference]: Without dead ends: 2265 [2024-11-21 22:03:06,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:06,469 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 172 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:06,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 386 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:03:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-21 22:03:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2076. [2024-11-21 22:03:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2075 states have (on average 1.192289156626506) internal successors, (2474), 2075 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2474 transitions. [2024-11-21 22:03:06,506 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2474 transitions. Word has length 207 [2024-11-21 22:03:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:06,506 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2474 transitions. [2024-11-21 22:03:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2474 transitions. [2024-11-21 22:03:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-21 22:03:06,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:06,509 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:06,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:03:06,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:06,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1594072215, now seen corresponding path program 1 times [2024-11-21 22:03:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494419766] [2024-11-21 22:03:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-21 22:03:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:06,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494419766] [2024-11-21 22:03:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494419766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:06,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506632944] [2024-11-21 22:03:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:06,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:06,737 INFO L87 Difference]: Start difference. First operand 2076 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:07,536 INFO L93 Difference]: Finished difference Result 4890 states and 5877 transitions. [2024-11-21 22:03:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 213 [2024-11-21 22:03:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:07,546 INFO L225 Difference]: With dead ends: 4890 [2024-11-21 22:03:07,546 INFO L226 Difference]: Without dead ends: 2816 [2024-11-21 22:03:07,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:07,550 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:07,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 387 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-21 22:03:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2024-11-21 22:03:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2811. [2024-11-21 22:03:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2810 states have (on average 1.1736654804270463) internal successors, (3298), 2810 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3298 transitions. [2024-11-21 22:03:07,593 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3298 transitions. Word has length 213 [2024-11-21 22:03:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:07,593 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 3298 transitions. [2024-11-21 22:03:07,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3298 transitions. [2024-11-21 22:03:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-21 22:03:07,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:07,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:07,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:03:07,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:07,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash -336607869, now seen corresponding path program 1 times [2024-11-21 22:03:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:07,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016801381] [2024-11-21 22:03:07,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:07,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016801381] [2024-11-21 22:03:07,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016801381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:07,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831957673] [2024-11-21 22:03:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:07,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:03:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:03:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:07,919 INFO L87 Difference]: Start difference. First operand 2811 states and 3298 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:09,105 INFO L93 Difference]: Finished difference Result 8956 states and 10588 transitions. [2024-11-21 22:03:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:03:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-11-21 22:03:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:09,128 INFO L225 Difference]: With dead ends: 8956 [2024-11-21 22:03:09,128 INFO L226 Difference]: Without dead ends: 6147 [2024-11-21 22:03:09,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:09,134 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 284 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:09,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 78 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-21 22:03:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2024-11-21 22:03:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5961. [2024-11-21 22:03:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 1.1758389261744966) internal successors, (7008), 5960 states have internal predecessors, (7008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7008 transitions. [2024-11-21 22:03:09,222 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7008 transitions. Word has length 252 [2024-11-21 22:03:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:09,222 INFO L471 AbstractCegarLoop]: Abstraction has 5961 states and 7008 transitions. [2024-11-21 22:03:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7008 transitions. [2024-11-21 22:03:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-21 22:03:09,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:09,228 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:03:09,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:09,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash 400013300, now seen corresponding path program 1 times [2024-11-21 22:03:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67669845] [2024-11-21 22:03:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-21 22:03:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67669845] [2024-11-21 22:03:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67669845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891965440] [2024-11-21 22:03:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:09,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:09,482 INFO L87 Difference]: Start difference. First operand 5961 states and 7008 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:10,130 INFO L93 Difference]: Finished difference Result 12099 states and 14259 transitions. [2024-11-21 22:03:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 290 [2024-11-21 22:03:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:10,153 INFO L225 Difference]: With dead ends: 12099 [2024-11-21 22:03:10,154 INFO L226 Difference]: Without dead ends: 7248 [2024-11-21 22:03:10,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:10,161 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:10,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 146 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2024-11-21 22:03:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 4664. [2024-11-21 22:03:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 1.1799270855672315) internal successors, (5502), 4663 states have internal predecessors, (5502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 5502 transitions. [2024-11-21 22:03:10,243 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 5502 transitions. Word has length 290 [2024-11-21 22:03:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:10,243 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 5502 transitions. [2024-11-21 22:03:10,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 5502 transitions. [2024-11-21 22:03:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-21 22:03:10,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:10,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:03:10,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash 441780138, now seen corresponding path program 1 times [2024-11-21 22:03:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632078439] [2024-11-21 22:03:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632078439] [2024-11-21 22:03:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632078439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:03:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517433538] [2024-11-21 22:03:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:03:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:03:10,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:03:10,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 22:03:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:11,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-21 22:03:11,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:03:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:12,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 22:03:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 113 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517433538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 22:03:14,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 22:03:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-21 22:03:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53654562] [2024-11-21 22:03:14,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 22:03:14,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 22:03:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 22:03:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-21 22:03:14,887 INFO L87 Difference]: Start difference. First operand 4664 states and 5502 transitions. Second operand has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:17,415 INFO L93 Difference]: Finished difference Result 12139 states and 14292 transitions. [2024-11-21 22:03:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 22:03:17,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 0 states have call successors, (0), 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 299 [2024-11-21 22:03:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:17,438 INFO L225 Difference]: With dead ends: 12139 [2024-11-21 22:03:17,438 INFO L226 Difference]: Without dead ends: 7845 [2024-11-21 22:03:17,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-21 22:03:17,446 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 898 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:17,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 184 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-21 22:03:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7845 states. [2024-11-21 22:03:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7845 to 4477. [2024-11-21 22:03:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1735924932975872) internal successors, (5253), 4476 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5253 transitions. [2024-11-21 22:03:17,540 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5253 transitions. Word has length 299 [2024-11-21 22:03:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5253 transitions. [2024-11-21 22:03:17,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.875) internal successors, (551), 7 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5253 transitions. [2024-11-21 22:03:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-21 22:03:17,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:17,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:17,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 22:03:17,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-21 22:03:17,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1087462780, now seen corresponding path program 1 times [2024-11-21 22:03:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987728326] [2024-11-21 22:03:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 22:03:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987728326] [2024-11-21 22:03:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987728326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:18,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009136478] [2024-11-21 22:03:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:18,074 INFO L87 Difference]: Start difference. First operand 4477 states and 5253 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:18,697 INFO L93 Difference]: Finished difference Result 11544 states and 13684 transitions. [2024-11-21 22:03:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 319 [2024-11-21 22:03:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:18,708 INFO L225 Difference]: With dead ends: 11544 [2024-11-21 22:03:18,708 INFO L226 Difference]: Without dead ends: 7437 [2024-11-21 22:03:18,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:18,714 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:18,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 147 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:03:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2024-11-21 22:03:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 7434. [2024-11-21 22:03:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7434 states, 7433 states have (on average 1.1590205838826853) internal successors, (8615), 7433 states have internal predecessors, (8615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 8615 transitions. [2024-11-21 22:03:18,796 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 8615 transitions. Word has length 319 [2024-11-21 22:03:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:18,797 INFO L471 AbstractCegarLoop]: Abstraction has 7434 states and 8615 transitions. [2024-11-21 22:03:18,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 8615 transitions. [2024-11-21 22:03:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-21 22:03:18,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:18,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 22:03:18,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2117266511, now seen corresponding path program 1 times [2024-11-21 22:03:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045601938] [2024-11-21 22:03:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:03:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045601938] [2024-11-21 22:03:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045601938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:19,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:03:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334323238] [2024-11-21 22:03:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:19,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:03:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:03:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:19,169 INFO L87 Difference]: Start difference. First operand 7434 states and 8615 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:20,272 INFO L93 Difference]: Finished difference Result 18556 states and 21601 transitions. [2024-11-21 22:03:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:03:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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 330 [2024-11-21 22:03:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:20,302 INFO L225 Difference]: With dead ends: 18556 [2024-11-21 22:03:20,302 INFO L226 Difference]: Without dead ends: 11492 [2024-11-21 22:03:20,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:20,311 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 278 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:20,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 61 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 22:03:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11492 states. [2024-11-21 22:03:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11492 to 10201. [2024-11-21 22:03:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.1384313725490196) internal successors, (11612), 10200 states have internal predecessors, (11612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 11612 transitions. [2024-11-21 22:03:20,486 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 11612 transitions. Word has length 330 [2024-11-21 22:03:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:20,487 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 11612 transitions. [2024-11-21 22:03:20,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 11612 transitions. [2024-11-21 22:03:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-21 22:03:20,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:20,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:20,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 22:03:20,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:20,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1773560037, now seen corresponding path program 1 times [2024-11-21 22:03:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680446435] [2024-11-21 22:03:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-21 22:03:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680446435] [2024-11-21 22:03:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680446435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 22:03:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49715674] [2024-11-21 22:03:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:03:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:03:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:20,952 INFO L87 Difference]: Start difference. First operand 10201 states and 11612 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:21,876 INFO L93 Difference]: Finished difference Result 21875 states and 24945 transitions. [2024-11-21 22:03:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:03:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2024-11-21 22:03:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:21,895 INFO L225 Difference]: With dead ends: 21875 [2024-11-21 22:03:21,895 INFO L226 Difference]: Without dead ends: 12044 [2024-11-21 22:03:21,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:03:21,906 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 264 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:21,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 61 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:03:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12044 states. [2024-11-21 22:03:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12044 to 10201. [2024-11-21 22:03:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.1384313725490196) internal successors, (11612), 10200 states have internal predecessors, (11612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 11612 transitions. [2024-11-21 22:03:22,028 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 11612 transitions. Word has length 404 [2024-11-21 22:03:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:22,029 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 11612 transitions. [2024-11-21 22:03:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 11612 transitions. [2024-11-21 22:03:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2024-11-21 22:03:22,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:03:22,045 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 22:03:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 22:03:22,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:03:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:03:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1078623225, now seen corresponding path program 1 times [2024-11-21 22:03:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:03:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774301090] [2024-11-21 22:03:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:03:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:03:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:03:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-21 22:03:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:03:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774301090] [2024-11-21 22:03:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774301090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:03:22,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:03:22,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:03:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443552187] [2024-11-21 22:03:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:03:22,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:03:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:03:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:03:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:22,467 INFO L87 Difference]: Start difference. First operand 10201 states and 11612 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:03:23,174 INFO L93 Difference]: Finished difference Result 21685 states and 24759 transitions. [2024-11-21 22:03:23,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:03:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 668 [2024-11-21 22:03:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:03:23,176 INFO L225 Difference]: With dead ends: 21685 [2024-11-21 22:03:23,176 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:03:23,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:03:23,191 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 22:03:23,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 363 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 22:03:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:03:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:03:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:03:23,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 668 [2024-11-21 22:03:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:03:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:03:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:03:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:03:23,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:03:23,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:03:23,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 22:03:23,200 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:03:23,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:03:24,878 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:03:24,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:03:24 BoogieIcfgContainer [2024-11-21 22:03:24,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:03:24,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:03:24,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:03:24,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:03:24,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:59" (3/4) ... [2024-11-21 22:03:24,903 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:03:24,923 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:03:24,924 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:03:24,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:03:24,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:03:25,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:03:25,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:03:25,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:03:25,109 INFO L158 Benchmark]: Toolchain (without parser) took 28224.73ms. Allocated memory was 153.1MB in the beginning and 559.9MB in the end (delta: 406.8MB). Free memory was 113.3MB in the beginning and 376.9MB in the end (delta: -263.7MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,110 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:03:25,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.57ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 65.0MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.04ms. Allocated memory is still 153.1MB. Free memory was 65.0MB in the beginning and 48.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,110 INFO L158 Benchmark]: Boogie Preprocessor took 253.23ms. Allocated memory is still 153.1MB. Free memory was 48.3MB in the beginning and 94.9MB in the end (delta: -46.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,111 INFO L158 Benchmark]: RCFGBuilder took 1705.30ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 94.9MB in the beginning and 121.2MB in the end (delta: -26.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,111 INFO L158 Benchmark]: TraceAbstraction took 25145.62ms. Allocated memory was 222.3MB in the beginning and 559.9MB in the end (delta: 337.6MB). Free memory was 121.2MB in the beginning and 393.7MB in the end (delta: -272.5MB). Peak memory consumption was 300.3MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,111 INFO L158 Benchmark]: Witness Printer took 208.44ms. Allocated memory is still 559.9MB. Free memory was 393.7MB in the beginning and 376.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 22:03:25,113 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.17ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.57ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 65.0MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.04ms. Allocated memory is still 153.1MB. Free memory was 65.0MB in the beginning and 48.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 253.23ms. Allocated memory is still 153.1MB. Free memory was 48.3MB in the beginning and 94.9MB in the end (delta: -46.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1705.30ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 94.9MB in the beginning and 121.2MB in the end (delta: -26.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25145.62ms. Allocated memory was 222.3MB in the beginning and 559.9MB in the end (delta: 337.6MB). Free memory was 121.2MB in the beginning and 393.7MB in the end (delta: -272.5MB). Peak memory consumption was 300.3MB. Max. memory is 16.1GB. * Witness Printer took 208.44ms. Allocated memory is still 559.9MB. Free memory was 393.7MB in the beginning and 376.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 91]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3418 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3418 mSDsluCounter, 2780 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 1861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11447 IncrementalHoareTripleChecker+Invalid, 13308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1861 mSolverCounterUnsat, 2383 mSDtfsCounter, 11447 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10201occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 9481 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 3781 NumberOfCodeBlocks, 3781 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4064 ConstructedInterpolants, 0 QuantifiedInterpolants, 16020 SizeOfPredicates, 8 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 3191/3320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((((((a25 == 13) && (a29 <= 599999)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 == 11) && (((long long) a29 + 22) <= 0)) && (a4 == 1))) || ((a4 == 0) && (a29 <= 599998))) || (((((long long) a29 + 21) <= 0) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a29 <= 599999)) && (a4 == 1)) && (a23 <= 312))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:03:25,135 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