./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label27.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 7c6f0a8bc653ee68bba5d1e7193079f2216382bf70b295e228b301f341587f5f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:49:52,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:49:52,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:49:52,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:49:52,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:49:52,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:49:52,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:49:52,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:49:52,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:49:52,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:49:52,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:49:52,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:49:52,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:49:52,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:49:52,319 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:49:52,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:49:52,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:49:52,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:49:52,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:49:52,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:49:52,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:49:52,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:49:52,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:49:52,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:49:52,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:49:52,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:49:52,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:49:52,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:49:52,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:49:52,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:49:52,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:49:52,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:49:52,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:49:52,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:49:52,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:49:52,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:49:52,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:49:52,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:49:52,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:49:52,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:49:52,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:49:52,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:49:52,330 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 -> 7c6f0a8bc653ee68bba5d1e7193079f2216382bf70b295e228b301f341587f5f [2024-11-16 03:49:52,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:49:52,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:49:52,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:49:52,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:49:52,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:49:52,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label27.c [2024-11-16 03:49:54,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:49:54,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:49:54,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label27.c [2024-11-16 03:49:54,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab5327ef/4a0a7f5ad02d48b1affcb0d3ead01a24/FLAGd252ad34c [2024-11-16 03:49:54,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab5327ef/4a0a7f5ad02d48b1affcb0d3ead01a24 [2024-11-16 03:49:54,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:49:54,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:49:54,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:49:54,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:49:54,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:49:54,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:49:54" (1/1) ... [2024-11-16 03:49:54,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3f447f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:54, skipping insertion in model container [2024-11-16 03:49:54,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:49:54" (1/1) ... [2024-11-16 03:49:54,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:49:55,059 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_label27.c[6152,6165] [2024-11-16 03:49:55,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:49:55,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:49:55,384 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_label27.c[6152,6165] [2024-11-16 03:49:55,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:49:55,602 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:49:55,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55 WrapperNode [2024-11-16 03:49:55,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:49:55,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:49:55,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:49:55,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:49:55,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,762 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-16 03:49:55,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:49:55,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:49:55,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:49:55,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:49:55,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,849 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-16 03:49:55,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:49:55,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:49:55,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:49:55,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:49:55,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (1/1) ... [2024-11-16 03:49:55,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:49:55,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:49:55,983 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-16 03:49:55,986 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-16 03:49:56,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:49:56,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:49:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:49:56,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:49:56,101 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:49:56,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:49:57,665 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-16 03:49:57,665 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:49:57,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:49:57,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:49:57,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:57 BoogieIcfgContainer [2024-11-16 03:49:57,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:49:57,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:49:57,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:49:57,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:49:57,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:49:54" (1/3) ... [2024-11-16 03:49:57,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fe4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:49:57, skipping insertion in model container [2024-11-16 03:49:57,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:49:55" (2/3) ... [2024-11-16 03:49:57,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fe4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:49:57, skipping insertion in model container [2024-11-16 03:49:57,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:57" (3/3) ... [2024-11-16 03:49:57,737 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label27.c [2024-11-16 03:49:57,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:49:57,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:49:57,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:49:57,843 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;@d0564ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:49:57,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:49:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 0 states have call successors, (0), 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-16 03:49:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 03:49:57,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:57,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:49:57,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1497476482, now seen corresponding path program 1 times [2024-11-16 03:49:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323994774] [2024-11-16 03:49:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:58,243 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-16 03:49:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323994774] [2024-11-16 03:49:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323994774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:49:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250246316] [2024-11-16 03:49:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:58,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:58,284 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 1.7077464788732395) internal successors, (485), 285 states have internal predecessors, (485), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 03:49:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:49:59,328 INFO L93 Difference]: Finished difference Result 775 states and 1366 transitions. [2024-11-16 03:49:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:49:59,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-16 03:49:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:49:59,344 INFO L225 Difference]: With dead ends: 775 [2024-11-16 03:49:59,344 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:49:59,348 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-16 03:49:59,351 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 198 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 168 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-16 03:49:59,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 168 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 03:49:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:49:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2024-11-16 03:49:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5193236714975846) internal successors, (629), 414 states have internal predecessors, (629), 0 states have call successors, (0), 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-16 03:49:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 629 transitions. [2024-11-16 03:49:59,404 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 629 transitions. Word has length 44 [2024-11-16 03:49:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:49:59,405 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 629 transitions. [2024-11-16 03:49:59,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 03:49:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 629 transitions. [2024-11-16 03:49:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 03:49:59,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:49:59,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:49:59,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:49:59,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:49:59,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:49:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 520914871, now seen corresponding path program 1 times [2024-11-16 03:49:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:49:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577341692] [2024-11-16 03:49:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:49:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:49:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:49:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:49:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:49:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577341692] [2024-11-16 03:49:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577341692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:49:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:49:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:49:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317318514] [2024-11-16 03:49:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:49:59,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:49:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:49:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:49:59,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:49:59,641 INFO L87 Difference]: Start difference. First operand 415 states and 629 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 03:50:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:00,412 INFO L93 Difference]: Finished difference Result 1207 states and 1837 transitions. [2024-11-16 03:50:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:00,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-16 03:50:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:00,418 INFO L225 Difference]: With dead ends: 1207 [2024-11-16 03:50:00,418 INFO L226 Difference]: Without dead ends: 794 [2024-11-16 03:50:00,421 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-16 03:50:00,422 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:00,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 180 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-16 03:50:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2024-11-16 03:50:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.3720050441361917) internal successors, (1088), 793 states have internal predecessors, (1088), 0 states have call successors, (0), 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-16 03:50:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1088 transitions. [2024-11-16 03:50:00,459 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1088 transitions. Word has length 111 [2024-11-16 03:50:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:00,459 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1088 transitions. [2024-11-16 03:50:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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-16 03:50:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1088 transitions. [2024-11-16 03:50:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 03:50:00,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:00,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, 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] [2024-11-16 03:50:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:50:00,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -548558163, now seen corresponding path program 1 times [2024-11-16 03:50:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631253115] [2024-11-16 03:50:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:50:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:00,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631253115] [2024-11-16 03:50:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631253115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:00,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:00,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:50:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742442961] [2024-11-16 03:50:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:00,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:00,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:00,829 INFO L87 Difference]: Start difference. First operand 794 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 03:50:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:01,594 INFO L93 Difference]: Finished difference Result 2328 states and 3195 transitions. [2024-11-16 03:50:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-16 03:50:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:01,602 INFO L225 Difference]: With dead ends: 2328 [2024-11-16 03:50:01,602 INFO L226 Difference]: Without dead ends: 1536 [2024-11-16 03:50:01,604 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-16 03:50:01,605 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 119 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:01,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 197 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-16 03:50:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-16 03:50:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.2157757496740547) internal successors, (1865), 1534 states have internal predecessors, (1865), 0 states have call successors, (0), 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-16 03:50:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1865 transitions. [2024-11-16 03:50:01,634 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1865 transitions. Word has length 115 [2024-11-16 03:50:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:01,635 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1865 transitions. [2024-11-16 03:50:01,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 03:50:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1865 transitions. [2024-11-16 03:50:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 03:50:01,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:01,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:50:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:50:01,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2114523638, now seen corresponding path program 1 times [2024-11-16 03:50:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834693544] [2024-11-16 03:50:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:50:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834693544] [2024-11-16 03:50:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834693544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972990960] [2024-11-16 03:50:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:50:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:01,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:50:01,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:50:01,950 INFO L87 Difference]: Start difference. First operand 1535 states and 1865 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:50:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:03,272 INFO L93 Difference]: Finished difference Result 4208 states and 5363 transitions. [2024-11-16 03:50:03,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:50:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-16 03:50:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:03,284 INFO L225 Difference]: With dead ends: 4208 [2024-11-16 03:50:03,285 INFO L226 Difference]: Without dead ends: 2860 [2024-11-16 03:50:03,288 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-16 03:50:03,289 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 353 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:03,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 93 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 03:50:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2024-11-16 03:50:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2859. [2024-11-16 03:50:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 1.254373687893632) internal successors, (3585), 2858 states have internal predecessors, (3585), 0 states have call successors, (0), 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-16 03:50:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 3585 transitions. [2024-11-16 03:50:03,343 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 3585 transitions. Word has length 172 [2024-11-16 03:50:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:03,344 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 3585 transitions. [2024-11-16 03:50:03,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:50:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3585 transitions. [2024-11-16 03:50:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-16 03:50:03,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:03,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:50:03,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:50:03,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:03,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash -700414283, now seen corresponding path program 1 times [2024-11-16 03:50:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905792056] [2024-11-16 03:50:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-16 03:50:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905792056] [2024-11-16 03:50:03,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905792056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:03,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:03,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:03,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963374629] [2024-11-16 03:50:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:03,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:03,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:03,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:03,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:03,663 INFO L87 Difference]: Start difference. First operand 2859 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:04,484 INFO L93 Difference]: Finished difference Result 6467 states and 8319 transitions. [2024-11-16 03:50:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 228 [2024-11-16 03:50:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:04,502 INFO L225 Difference]: With dead ends: 6467 [2024-11-16 03:50:04,502 INFO L226 Difference]: Without dead ends: 3980 [2024-11-16 03:50:04,506 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-16 03:50:04,507 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:04,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 398 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:50:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-11-16 03:50:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3970. [2024-11-16 03:50:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3969 states have (on average 1.2300327538422777) internal successors, (4882), 3969 states have internal predecessors, (4882), 0 states have call successors, (0), 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-16 03:50:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 4882 transitions. [2024-11-16 03:50:04,577 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 4882 transitions. Word has length 228 [2024-11-16 03:50:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:04,578 INFO L471 AbstractCegarLoop]: Abstraction has 3970 states and 4882 transitions. [2024-11-16 03:50:04,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 4882 transitions. [2024-11-16 03:50:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-16 03:50:04,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:04,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:50:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:50:04,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:04,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1837889754, now seen corresponding path program 1 times [2024-11-16 03:50:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091494809] [2024-11-16 03:50:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-16 03:50:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091494809] [2024-11-16 03:50:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091494809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165591760] [2024-11-16 03:50:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:04,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:04,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:04,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:04,950 INFO L87 Difference]: Start difference. First operand 3970 states and 4882 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:05,790 INFO L93 Difference]: Finished difference Result 9056 states and 11304 transitions. [2024-11-16 03:50:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:05,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 234 [2024-11-16 03:50:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:05,809 INFO L225 Difference]: With dead ends: 9056 [2024-11-16 03:50:05,810 INFO L226 Difference]: Without dead ends: 5273 [2024-11-16 03:50:05,816 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-16 03:50:05,818 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 154 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:05,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 395 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:50:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2024-11-16 03:50:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5265. [2024-11-16 03:50:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 5264 states have (on average 1.2095364741641337) internal successors, (6367), 5264 states have internal predecessors, (6367), 0 states have call successors, (0), 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-16 03:50:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 6367 transitions. [2024-11-16 03:50:05,915 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 6367 transitions. Word has length 234 [2024-11-16 03:50:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:05,915 INFO L471 AbstractCegarLoop]: Abstraction has 5265 states and 6367 transitions. [2024-11-16 03:50:05,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 6367 transitions. [2024-11-16 03:50:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-16 03:50:05,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:05,921 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:50:05,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:50:05,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1486437481, now seen corresponding path program 1 times [2024-11-16 03:50:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423824802] [2024-11-16 03:50:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-16 03:50:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423824802] [2024-11-16 03:50:06,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423824802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:06,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435960567] [2024-11-16 03:50:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:06,183 INFO L87 Difference]: Start difference. First operand 5265 states and 6367 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:06,950 INFO L93 Difference]: Finished difference Result 11297 states and 14034 transitions. [2024-11-16 03:50:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 240 [2024-11-16 03:50:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:06,973 INFO L225 Difference]: With dead ends: 11297 [2024-11-16 03:50:06,973 INFO L226 Difference]: Without dead ends: 7150 [2024-11-16 03:50:06,979 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-16 03:50:06,983 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 194 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:06,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 356 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2024-11-16 03:50:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 7145. [2024-11-16 03:50:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7145 states, 7144 states have (on average 1.2232642777155656) internal successors, (8739), 7144 states have internal predecessors, (8739), 0 states have call successors, (0), 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-16 03:50:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 8739 transitions. [2024-11-16 03:50:07,123 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 8739 transitions. Word has length 240 [2024-11-16 03:50:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:07,124 INFO L471 AbstractCegarLoop]: Abstraction has 7145 states and 8739 transitions. [2024-11-16 03:50:07,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-16 03:50:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 8739 transitions. [2024-11-16 03:50:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-16 03:50:07,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:07,131 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:50:07,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:50:07,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:07,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash -895275437, now seen corresponding path program 1 times [2024-11-16 03:50:07,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:07,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041617164] [2024-11-16 03:50:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:07,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-16 03:50:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041617164] [2024-11-16 03:50:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041617164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556788366] [2024-11-16 03:50:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:07,409 INFO L87 Difference]: Start difference. First operand 7145 states and 8739 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 03:50:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:08,247 INFO L93 Difference]: Finished difference Result 13940 states and 17134 transitions. [2024-11-16 03:50:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 306 [2024-11-16 03:50:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:08,280 INFO L225 Difference]: With dead ends: 13940 [2024-11-16 03:50:08,281 INFO L226 Difference]: Without dead ends: 7167 [2024-11-16 03:50:08,289 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-16 03:50:08,291 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:08,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 348 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7167 states. [2024-11-16 03:50:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 6775. [2024-11-16 03:50:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6775 states, 6774 states have (on average 1.1840862119870093) internal successors, (8021), 6774 states have internal predecessors, (8021), 0 states have call successors, (0), 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-16 03:50:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6775 states to 6775 states and 8021 transitions. [2024-11-16 03:50:08,406 INFO L78 Accepts]: Start accepts. Automaton has 6775 states and 8021 transitions. Word has length 306 [2024-11-16 03:50:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:08,407 INFO L471 AbstractCegarLoop]: Abstraction has 6775 states and 8021 transitions. [2024-11-16 03:50:08,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 03:50:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6775 states and 8021 transitions. [2024-11-16 03:50:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-16 03:50:08,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:08,414 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:50:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:50:08,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1577652507, now seen corresponding path program 1 times [2024-11-16 03:50:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649327802] [2024-11-16 03:50:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-16 03:50:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649327802] [2024-11-16 03:50:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649327802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779710042] [2024-11-16 03:50:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:08,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:08,673 INFO L87 Difference]: Start difference. First operand 6775 states and 8021 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 03:50:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:09,439 INFO L93 Difference]: Finished difference Result 12771 states and 15182 transitions. [2024-11-16 03:50:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2024-11-16 03:50:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:09,458 INFO L225 Difference]: With dead ends: 12771 [2024-11-16 03:50:09,459 INFO L226 Difference]: Without dead ends: 6368 [2024-11-16 03:50:09,466 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-16 03:50:09,468 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 162 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:09,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 152 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2024-11-16 03:50:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 6179. [2024-11-16 03:50:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6179 states, 6178 states have (on average 1.1356426027840725) internal successors, (7016), 6178 states have internal predecessors, (7016), 0 states have call successors, (0), 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-16 03:50:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6179 states to 6179 states and 7016 transitions. [2024-11-16 03:50:09,554 INFO L78 Accepts]: Start accepts. Automaton has 6179 states and 7016 transitions. Word has length 307 [2024-11-16 03:50:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:09,555 INFO L471 AbstractCegarLoop]: Abstraction has 6179 states and 7016 transitions. [2024-11-16 03:50:09,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-16 03:50:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6179 states and 7016 transitions. [2024-11-16 03:50:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-16 03:50:09,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:09,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-16 03:50:09,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:50:09,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash -554113788, now seen corresponding path program 1 times [2024-11-16 03:50:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688687142] [2024-11-16 03:50:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-16 03:50:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688687142] [2024-11-16 03:50:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688687142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699205261] [2024-11-16 03:50:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:09,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:09,760 INFO L87 Difference]: Start difference. First operand 6179 states and 7016 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 03:50:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:10,605 INFO L93 Difference]: Finished difference Result 15871 states and 18141 transitions. [2024-11-16 03:50:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2024-11-16 03:50:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:10,630 INFO L225 Difference]: With dead ends: 15871 [2024-11-16 03:50:10,631 INFO L226 Difference]: Without dead ends: 10064 [2024-11-16 03:50:10,640 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-16 03:50:10,641 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 164 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:10,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 352 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 03:50:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10064 states. [2024-11-16 03:50:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10064 to 10064. [2024-11-16 03:50:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10064 states, 10063 states have (on average 1.1159693928252012) internal successors, (11230), 10063 states have internal predecessors, (11230), 0 states have call successors, (0), 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-16 03:50:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10064 states to 10064 states and 11230 transitions. [2024-11-16 03:50:10,778 INFO L78 Accepts]: Start accepts. Automaton has 10064 states and 11230 transitions. Word has length 312 [2024-11-16 03:50:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 10064 states and 11230 transitions. [2024-11-16 03:50:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 03:50:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10064 states and 11230 transitions. [2024-11-16 03:50:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-16 03:50:10,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:10,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 03:50:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:50:10,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -312905872, now seen corresponding path program 1 times [2024-11-16 03:50:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787282564] [2024-11-16 03:50:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-16 03:50:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787282564] [2024-11-16 03:50:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787282564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99469536] [2024-11-16 03:50:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:11,066 INFO L87 Difference]: Start difference. First operand 10064 states and 11230 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 03:50:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:11,690 INFO L93 Difference]: Finished difference Result 20491 states and 22889 transitions. [2024-11-16 03:50:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 340 [2024-11-16 03:50:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:11,711 INFO L225 Difference]: With dead ends: 20491 [2024-11-16 03:50:11,711 INFO L226 Difference]: Without dead ends: 11913 [2024-11-16 03:50:11,722 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-16 03:50:11,722 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:11,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 154 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:50:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11913 states. [2024-11-16 03:50:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11913 to 7465. [2024-11-16 03:50:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7465 states, 7464 states have (on average 1.1219185423365488) internal successors, (8374), 7464 states have internal predecessors, (8374), 0 states have call successors, (0), 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-16 03:50:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 8374 transitions. [2024-11-16 03:50:11,843 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 8374 transitions. Word has length 340 [2024-11-16 03:50:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:11,844 INFO L471 AbstractCegarLoop]: Abstraction has 7465 states and 8374 transitions. [2024-11-16 03:50:11,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-16 03:50:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 8374 transitions. [2024-11-16 03:50:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 03:50:11,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:11,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:50:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 03:50:11,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1812425108, now seen corresponding path program 1 times [2024-11-16 03:50:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515387860] [2024-11-16 03:50:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:50:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:12,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515387860] [2024-11-16 03:50:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515387860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:50:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853694190] [2024-11-16 03:50:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:50:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:50:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:50:12,274 INFO L87 Difference]: Start difference. First operand 7465 states and 8374 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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-16 03:50:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:13,482 INFO L93 Difference]: Finished difference Result 19008 states and 21371 transitions. [2024-11-16 03:50:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:50:13,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2024-11-16 03:50:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:13,505 INFO L225 Difference]: With dead ends: 19008 [2024-11-16 03:50:13,506 INFO L226 Difference]: Without dead ends: 11545 [2024-11-16 03:50:13,515 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-16 03:50:13,516 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:13,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 69 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 03:50:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11545 states. [2024-11-16 03:50:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11545 to 10802. [2024-11-16 03:50:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10802 states, 10801 states have (on average 1.106101286917878) internal successors, (11947), 10801 states have internal predecessors, (11947), 0 states have call successors, (0), 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-16 03:50:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10802 states to 10802 states and 11947 transitions. [2024-11-16 03:50:13,699 INFO L78 Accepts]: Start accepts. Automaton has 10802 states and 11947 transitions. Word has length 351 [2024-11-16 03:50:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:13,700 INFO L471 AbstractCegarLoop]: Abstraction has 10802 states and 11947 transitions. [2024-11-16 03:50:13,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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-16 03:50:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 10802 states and 11947 transitions. [2024-11-16 03:50:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-16 03:50:13,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:13,714 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-16 03:50:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:50:13,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -714552833, now seen corresponding path program 1 times [2024-11-16 03:50:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635890194] [2024-11-16 03:50:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-16 03:50:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635890194] [2024-11-16 03:50:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635890194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:14,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:50:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464626074] [2024-11-16 03:50:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:50:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:50:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:50:14,282 INFO L87 Difference]: Start difference. First operand 10802 states and 11947 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 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-16 03:50:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:15,310 INFO L93 Difference]: Finished difference Result 24010 states and 26542 transitions. [2024-11-16 03:50:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:50:15,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 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 426 [2024-11-16 03:50:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:15,331 INFO L225 Difference]: With dead ends: 24010 [2024-11-16 03:50:15,332 INFO L226 Difference]: Without dead ends: 13210 [2024-11-16 03:50:15,343 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-16 03:50:15,345 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:15,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 69 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 03:50:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13210 states. [2024-11-16 03:50:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13210 to 10802. [2024-11-16 03:50:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10802 states, 10801 states have (on average 1.106101286917878) internal successors, (11947), 10801 states have internal predecessors, (11947), 0 states have call successors, (0), 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-16 03:50:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10802 states to 10802 states and 11947 transitions. [2024-11-16 03:50:15,483 INFO L78 Accepts]: Start accepts. Automaton has 10802 states and 11947 transitions. Word has length 426 [2024-11-16 03:50:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 10802 states and 11947 transitions. [2024-11-16 03:50:15,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 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-16 03:50:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10802 states and 11947 transitions. [2024-11-16 03:50:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2024-11-16 03:50:15,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:15,547 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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-16 03:50:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:50:15,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2007575188, now seen corresponding path program 1 times [2024-11-16 03:50:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85266409] [2024-11-16 03:50:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2516 backedges. 1635 proven. 52 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-16 03:50:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85266409] [2024-11-16 03:50:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85266409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:50:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139003416] [2024-11-16 03:50:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:50:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:50:17,383 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-16 03:50:17,385 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-16 03:50:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:17,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:50:17,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:50:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2516 backedges. 1687 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-16 03:50:18,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:50:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139003416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:50:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:50:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856636715] [2024-11-16 03:50:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:18,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:50:18,008 INFO L87 Difference]: Start difference. First operand 10802 states and 11947 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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-16 03:50:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:18,657 INFO L93 Difference]: Finished difference Result 24932 states and 27636 transitions. [2024-11-16 03:50:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 923 [2024-11-16 03:50:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:18,681 INFO L225 Difference]: With dead ends: 24932 [2024-11-16 03:50:18,682 INFO L226 Difference]: Without dead ends: 14132 [2024-11-16 03:50:18,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:50:18,692 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 100 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:18,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 122 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:50:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2024-11-16 03:50:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 11727. [2024-11-16 03:50:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11727 states, 11726 states have (on average 1.1048951048951048) internal successors, (12956), 11726 states have internal predecessors, (12956), 0 states have call successors, (0), 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-16 03:50:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 12956 transitions. [2024-11-16 03:50:18,845 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 12956 transitions. Word has length 923 [2024-11-16 03:50:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 11727 states and 12956 transitions. [2024-11-16 03:50:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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-16 03:50:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 12956 transitions. [2024-11-16 03:50:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-11-16 03:50:18,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:18,867 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:50:18,885 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-16 03:50:19,067 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,SelfDestructingSolverStorable13 [2024-11-16 03:50:19,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:19,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1631240468, now seen corresponding path program 1 times [2024-11-16 03:50:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529871335] [2024-11-16 03:50:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2571 backedges. 1723 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2024-11-16 03:50:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529871335] [2024-11-16 03:50:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529871335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:50:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970122370] [2024-11-16 03:50:19,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:19,645 INFO L87 Difference]: Start difference. First operand 11727 states and 12956 transitions. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-16 03:50:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:20,405 INFO L93 Difference]: Finished difference Result 25119 states and 27730 transitions. [2024-11-16 03:50:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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 956 [2024-11-16 03:50:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:20,423 INFO L225 Difference]: With dead ends: 25119 [2024-11-16 03:50:20,423 INFO L226 Difference]: Without dead ends: 13394 [2024-11-16 03:50:20,433 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-16 03:50:20,434 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:20,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 157 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:50:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13394 states. [2024-11-16 03:50:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13394 to 10979. [2024-11-16 03:50:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10979 states, 10978 states have (on average 1.1035707779194752) internal successors, (12115), 10978 states have internal predecessors, (12115), 0 states have call successors, (0), 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-16 03:50:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10979 states to 10979 states and 12115 transitions. [2024-11-16 03:50:20,569 INFO L78 Accepts]: Start accepts. Automaton has 10979 states and 12115 transitions. Word has length 956 [2024-11-16 03:50:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:20,570 INFO L471 AbstractCegarLoop]: Abstraction has 10979 states and 12115 transitions. [2024-11-16 03:50:20,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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-16 03:50:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 10979 states and 12115 transitions. [2024-11-16 03:50:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2024-11-16 03:50:20,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:50:20,590 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-16 03:50:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:50:20,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:50:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:50:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1484100790, now seen corresponding path program 1 times [2024-11-16 03:50:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:50:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038396533] [2024-11-16 03:50:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:50:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:50:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:50:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3189 backedges. 1827 proven. 0 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2024-11-16 03:50:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:50:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038396533] [2024-11-16 03:50:21,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038396533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:50:21,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:50:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:50:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887605322] [2024-11-16 03:50:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:50:21,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:50:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:50:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:50:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:50:21,200 INFO L87 Difference]: Start difference. First operand 10979 states and 12115 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 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-16 03:50:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:50:21,538 INFO L93 Difference]: Finished difference Result 19344 states and 21283 transitions. [2024-11-16 03:50:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:50:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 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 1052 [2024-11-16 03:50:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:50:21,540 INFO L225 Difference]: With dead ends: 19344 [2024-11-16 03:50:21,540 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:50:21,548 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-16 03:50:21,549 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:50:21,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 31 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:50:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:50:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:50:21,550 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-16 03:50:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:50:21,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1052 [2024-11-16 03:50:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:50:21,551 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:50:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 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-16 03:50:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:50:21,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:50:21,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:50:21,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 03:50:21,560 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:50:21,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:50:23,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:50:23,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:50:23 BoogieIcfgContainer [2024-11-16 03:50:23,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:50:23,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:50:23,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:50:23,169 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:50:23,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:49:57" (3/4) ... [2024-11-16 03:50:23,172 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:50:23,193 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:50:23,195 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:50:23,196 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:50:23,197 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:50:23,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:50:23,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:50:23,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:50:23,389 INFO L158 Benchmark]: Toolchain (without parser) took 28630.48ms. Allocated memory was 144.7MB in the beginning and 761.3MB in the end (delta: 616.6MB). Free memory was 87.3MB in the beginning and 351.5MB in the end (delta: -264.1MB). Peak memory consumption was 355.4MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,389 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:50:23,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 844.25ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 86.8MB in the beginning and 170.4MB in the end (delta: -83.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.72ms. Allocated memory is still 218.1MB. Free memory was 170.4MB in the beginning and 152.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,390 INFO L158 Benchmark]: Boogie Preprocessor took 183.81ms. Allocated memory is still 218.1MB. Free memory was 152.6MB in the beginning and 128.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,390 INFO L158 Benchmark]: IcfgBuilder took 1779.17ms. Allocated memory is still 218.1MB. Free memory was 128.5MB in the beginning and 169.9MB in the end (delta: -41.4MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,391 INFO L158 Benchmark]: TraceAbstraction took 25440.08ms. Allocated memory was 218.1MB in the beginning and 761.3MB in the end (delta: 543.2MB). Free memory was 169.9MB in the beginning and 369.3MB in the end (delta: -199.4MB). Peak memory consumption was 470.6MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,391 INFO L158 Benchmark]: Witness Printer took 219.32ms. Allocated memory is still 761.3MB. Free memory was 369.3MB in the beginning and 351.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 03:50:23,394 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.16ms. Allocated memory is still 144.7MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 844.25ms. Allocated memory was 144.7MB in the beginning and 218.1MB in the end (delta: 73.4MB). Free memory was 86.8MB in the beginning and 170.4MB in the end (delta: -83.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.72ms. Allocated memory is still 218.1MB. Free memory was 170.4MB in the beginning and 152.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 183.81ms. Allocated memory is still 218.1MB. Free memory was 152.6MB in the beginning and 128.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1779.17ms. Allocated memory is still 218.1MB. Free memory was 128.5MB in the beginning and 169.9MB in the end (delta: -41.4MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25440.08ms. Allocated memory was 218.1MB in the beginning and 761.3MB in the end (delta: 543.2MB). Free memory was 169.9MB in the beginning and 369.3MB in the end (delta: -199.4MB). Peak memory consumption was 470.6MB. Max. memory is 16.1GB. * Witness Printer took 219.32ms. Allocated memory is still 761.3MB. Free memory was 369.3MB in the beginning and 351.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 142]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2783 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2783 mSDsluCounter, 3241 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 1907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9893 IncrementalHoareTripleChecker+Invalid, 11800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1907 mSolverCounterUnsat, 2823 mSDtfsCounter, 9893 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11727occurred in iteration=14, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 13035 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 7040 NumberOfCodeBlocks, 7040 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7023 ConstructedInterpolants, 0 QuantifiedInterpolants, 17408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 13397/13449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:50:23,426 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